default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaura Barbulescu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j6]Jayanth Krishna Mogali
, Laura Barbulescu, Stephen F. Smith:
Efficient primal heuristic updates for the blocking job shop problem. Eur. J. Oper. Res. 295(1): 82-101 (2021)
2010 – 2019
- 2017
- [e1]Laura Barbulescu, Jeremy Frank, Mausam, Stephen F. Smith:
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, ICAPS 2017, Pittsburgh, Pennsylvania, USA, June 18-23, 2017. AAAI Press 2017 [contents] - 2012
- [c12]Zachary B. Rubinstein, Stephen F. Smith, Laura Barbulescu:
Incremental Management of Oversubscribed Vehicle Schedules in Dynamic Dial-A-Ride Problems. AAAI 2012: 1809-1815 - 2011
- [i1]Laura Barbulescu, Adele E. Howe, Mark Roberts, L. Darrell Whitley:
Understanding Algorithm Performance on an Oversubscribed Scheduling Application. CoRR abs/1110.2735 (2011) - 2010
- [c11]Laura Barbulescu, Zachary B. Rubinstein, Stephen F. Smith, Terry L. Zimmerman:
Distributed coordination of mobile agent teams: the advantage of planning ahead. AAMAS 2010: 1331-1338
2000 – 2009
- 2008
- [p1]L. Darrell Whitley, Andrew M. Sutton, Adele E. Howe, Laura Barbulescu:
Resource Scheduling with Permutation Based Representations: Three Applications. Evolutionary Computation in Practice 2008: 219-243 - 2007
- [c10]Laurence A. Kramer, Laura Barbulescu, Stephen F. Smith:
Understanding Performance Tradeoffs in Algorithms for Solving Oversubscribed Scheduling. AAAI 2007: 1019-1024 - 2006
- [j5]Laura Barbulescu, Adele E. Howe, L. Darrell Whitley, Mark Roberts:
Understanding Algorithm Performance on an Oversubscribed Scheduling Application. J. Artif. Intell. Res. 27: 577-615 (2006) - [j4]Laura Barbulescu, Adele E. Howe, L. Darrell Whitley:
AFSCN scheduling: How the problem and solution have evolved. Math. Comput. Model. 43(9-10): 1023-1037 (2006) - [c9]Stephen F. Smith, Anthony Gallagher, Terry L. Zimmerman, Laura Barbulescu, Zachary B. Rubinstein:
Multi-Agent Management of Joint Schedules. AAAI Spring Symposium: Distributed Plan and Schedule Management 2006: 128-135 - 2004
- [j3]Jonathan E. Rowe, L. Darrell Whitley, Laura Barbulescu, Jean-Paul Watson:
Properties of Gray and Binary Representations. Evol. Comput. 12(1): 46-76 (2004) - [j2]Laura Barbulescu, Jean-Paul Watson, L. Darrell Whitley, Adele E. Howe:
Scheduling Space-Ground Communications for the Air Force Satellite Control Network. J. Sched. 7(1): 7-34 (2004) - [c8]Laura Barbulescu, L. Darrell Whitley, Adele E. Howe:
Leap Before You Look: An Effective Strategy in an Oversubscribed Scheduling Problem. AAAI 2004: 143-148 - [c7]Laura Barbulescu, Adele E. Howe, L. Darrell Whitley, Mark Roberts:
Trading Places: How to Schedule More in a Multi-Resource Oversubscribed Scheduling Problem. ICAPS 2004: 227-234 - 2002
- [j1]Jean-Paul Watson, Laura Barbulescu, L. Darrell Whitley, Adele E. Howe:
Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance. INFORMS J. Comput. 14(2): 98-123 (2002) - [c6]Laura Barbulescu, Adele E. Howe, Jean-Paul Watson, L. Darrell Whitley:
Satellite Range Scheduling: A Comparison of Genetic, Heuristic and Local Search. PPSN 2002: 611-620 - 2000
- [c5]Laura Barbulescu, Jean-Paul Watson, L. Darrell Whitley:
Dynamic Representations and Escaping Local Optima: Improving Genetic Algorithms and Local Search. AAAI/IAAI 2000: 879-884 - [c4]L. Darrell Whitley, Laura Barbulescu, Jean-Paul Watson:
Local Search and High Precision Gray Codes: Convergence Results and Neighborhoods. FOGA 2000: 295-311
1990 – 1999
- 1999
- [c3]Jean-Paul Watson, Laura Barbulescu, Adele E. Howe, L. Darrell Whitley:
Algorithm Performance and Problem Structure for Flow-shop Scheduling. AAAI/IAAI 1999: 688-695 - 1998
- [c2]L. Darrell Whitley, Adele E. Howe, Soraya B. Rana, Jean-Paul Watson, Laura Barbulescu:
Comparing heuristic search methods and genetic algorithms for warehouse scheduling. SMC 1998: 2430-2435 - [c1]L. Darrell Whitley, Adele E. Howe, Soraya B. Rana, Jean-Paul Watson, Laura Barbulescu:
Comparing heuristic search methods and genetic algorithms for warehouse scheduling. SMC 1998: 2466-2471
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
