Laura Barbulescu
Laura Barbulescu
Zweryfikowany adres z cs.cmu.edu
Cytowane przez
Cytowane przez
Scheduling space–ground communications for the air force satellite control network
L Barbulescu, JP Watson, LD Whitley, AE Howe
Journal of Scheduling 7, 7-34, 2004
Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance
JP Watson, L Barbulescu, LD Whitley, AE Howe
INFORMS Journal on Computing 14 (2), 98-123, 2002
AFSCN scheduling: How the problem and solution have evolved
L Barbulescu, A Howe, D Whitley
Mathematical and Computer Modelling 43 (9-10), 1023-1037, 2006
Satellite range scheduling: A comparison of genetic, heuristic and local search
L Barbulescu, AE Howe, JP Watson, LD Whitley
Parallel Problem Solving from Nature—PPSN VII: 7th International Conference …, 2002
Algorithm Performance and Problem Structure for Flow-shop Scheduling.
JP Watson, L Barbulescu, AE Howe, LD Whitley
AAAI/IAAI, 688-695, 1999
Understanding algorithm performance on an oversubscribed scheduling application
L Barbulescu, AE Howe, LD Whitley, M Roberts
Journal of Artificial Intelligence Research 27, 577-615, 2006
Leap before you look: An effective strategy in an oversubscribed scheduling problem
L Barbulescu, LD Whitley, AE Howe
AAAI 4, 143-148, 2004
Properties of gray and binary representations
J Rowe, D Whitley, L Barbulescu, JP Watson
Evolutionary computation 12 (1), 47-76, 2004
Trading Places: How to Schedule More in a Multi-Resource Oversubscribed Scheduling Problem.
L Barbulescu, AE Howe, LD Whitley, M Roberts
ICAPS, 227-234, 2004
Distributed coordination of mobile agent teams: the advantage of planning ahead
L Barbulescu, ZB Rubinstein, SF Smith, TL Zimmerman
Proceedings of the 9th International Conference on Autonomous Agents and …, 2010
Dynamic representations and escaping local optima: Improving genetic algorithms and local search
L Barbulescu, JP Watson, LD Whitley
AAAI/IAAI 2000, 879-884, 2000
Understanding performance tradeoffs in algorithms for solving oversubscribed scheduling
LA Kramer, L Barbulescu, SF Smith
Proceedings of the national conference on artificial intelligence 22 (2), 1019, 2007
Incremental management of oversubscribed vehicle schedules in dynamic dial-a-ride problems
Z Rubinstein, S Smith, L Barbulescu
Proceedings of the AAAI Conference on Artificial Intelligence 26 (1), 1809-1815, 2012
Multi-Agent Management of Joint Schedules.
SF Smith, A Gallagher, TL Zimmerman, L Barbulescu, ZB Rubinstein
AAAI Spring Symposium: Distributed Plan and Schedule Management, 128-135, 2006
Testing, evaluation and performance of optimization and learning systems
D Whitley, JP Watson, A Howe, L Barbulescu
Adaptive Computing in Design and Manufacture V, 27-39, 2002
Comparing heuristic search methods and genetic algorithms for warehouse scheduling
LD Whitley, AE Howe, S Rana, JP Watson, L Barbulescu
SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems …, 1998
Analyzing basic representation choices in oversubscribed scheduling problems
LA Kramer, LV Barbulescu, SF Smith
Proceedings of the 3rd Multidisciplinary International Scheduling Conference …, 2007
Local search and high precision gray codes: Convergence results and neighborhoods
D Whitley, L Barbulescu, JP Watson
Foundations of Genetic Algorithms 6, 295-311, 2001
Efficient primal heuristic updates for the blocking job shop problem
JK Mogali, L Barbulescu, SF Smith
European Journal of Operational Research 295 (1), 82-101, 2021
Toward a descriptive model of local search cost in job-shop scheduling
J Watson, J Beck, L Barbulescu, LD Whitley, A Howe
Proceedings of Sixth European Conference on Planning (ECP'01), Toledo, Spain, 2001
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20