Laura Barbulescu

According to our database1, Laura Barbulescu authored at least 18 papers between 1998 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Efficient primal heuristic updates for the blocking job shop problem.
Eur. J. Oper. Res., 2021

2012
Incremental Management of Oversubscribed Vehicle Schedules in Dynamic Dial-A-Ride Problems.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2010
Distributed coordination of mobile agent teams: the advantage of planning ahead.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

2008
Resource Scheduling with Permutation Based Representations: Three Applications.
Proceedings of the Evolutionary Computation in Practice, 2008

2007
Understanding Performance Tradeoffs in Algorithms for Solving Oversubscribed Scheduling.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
AFSCN scheduling: How the problem and solution have evolved.
Math. Comput. Model., 2006

Understanding Algorithm Performance on an Oversubscribed Scheduling Application.
J. Artif. Intell. Res., 2006

Multi-Agent Management of Joint Schedules.
Proceedings of the Distributed Plan and Schedule Management, 2006

2004
Scheduling Space-Ground Communications for the Air Force Satellite Control Network.
J. Sched., 2004

Properties of Gray and Binary Representations.
Evol. Comput., 2004

Trading Places: How to Schedule More in a Multi-Resource Oversubscribed Scheduling Problem.
Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS 2004), 2004

Leap Before You Look: An Effective Strategy in an Oversubscribed Scheduling Problem.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2002
Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance.
INFORMS J. Comput., 2002

Satellite Range Scheduling: A Comparison of Genetic, Heuristic and Local Search.
Proceedings of the Parallel Problem Solving from Nature, 2002

2000
Local Search and High Precision Gray Codes: Convergence Results and Neighborhoods.
Proceedings of the Sixth Workshop on Foundations of Genetic Algorithms, 2000

Dynamic Representations and Escaping Local Optima: Improving Genetic Algorithms and Local Search.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999
Algorithm Performance and Problem Structure for Flow-shop Scheduling.
Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, 1999

1998
Comparing heuristic search methods and genetic algorithms for warehouse scheduling.
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 1998


  Loading...