Sciweavers

2108 search results - page 79 / 422
» Constrained Heuristic Search
Sort
View
EOR
2006
57views more  EOR 2006»
15 years 6 months ago
Routing and wavelength assignment by partition colouring
The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, f...
Thiago F. Noronha, Celso C. Ribeiro
EOR
2010
104views more  EOR 2010»
15 years 3 months ago
New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
Fatih Safa Erenay, Ihsan Sabuncuoglu, Aysegül...
CP
2007
Springer
16 years 5 days ago
Min-Domain Ordering for Asynchronous Backtracking
Ordering heuristics are a powerful tool in CSP search algorithms. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the mi...
Roie Zivan, Moshe Zazone, Amnon Meisels
AIPS
2009
15 years 7 months ago
Structural-Pattern Databases
abstraction heuristics, notably pattern-database and merge-and-shrink heuristics, are employed by some state-ofthe-art optimal heuristic-search planners. The major limitation of t...
Michael Katz, Carmel Domshlak
CHI
2003
ACM
16 years 6 months ago
"This is a lot easier!": constrained movement speeds navigation
This paper reports on an experiment comparing constrained and unconstrained movement in a 2D zooming environment. Results for a directed search task showed a significant decrease ...
Susanne Jul