Sciweavers

501 search results - page 14 / 101
» Scheduling Abstractions for Local Search
Sort
View
ALGORITHMICA
2010
141views more  ALGORITHMICA 2010»
13 years 7 months ago
Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
Dániel Marx, Ildikó Schlotter
CP
2008
Springer
13 years 9 months ago
Adding Search to Zinc
Abstract. We describe a small, non-intrusive extension to the declarative modelling language Zinc that allows users to define model-specific search. This is achieved by providing a...
Reza Rafeh, Kim Marriott, Maria Garcia de la Banda...
CP
2001
Springer
13 years 12 months ago
Evaluation of Search Heuristics for Embedded System Scheduling Problems
Abstract. In this paper we consider the problem of optimal task allocation and scheduling in embedded real-time systems. This problem is far from trivial due to the wide range of c...
Cecilia Ekelin, Jan Jonsson
EVOW
2008
Springer
13 years 9 months ago
Reactive Stochastic Local Search Algorithms for the Genomic Median Problem
Abstract. The genomic median problem is an optimization problem inspired by a biological issue: it aims at finding the chromosome organization of the common ancestor to multiple li...
Renaud Lenne, Christine Solnon, Thomas Stützl...
AAAI
2000
13 years 8 months ago
Human-Guided Simple Search
Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some...
David Anderson, Emily Anderson, Neal Lesh, Joe Mar...