Sciweavers

3433 search results - page 221 / 687
» Heuristics for a bidding problem
Sort
View
HEURISTICS
2006
95views more  HEURISTICS 2006»
15 years 6 months ago
Hard and soft constraints for reasoning about qualitative conditional preferences
Many real life optimization problems are defined in terms of both hard and soft constraints, and qualitative conditional preferences. However, there is as yet no single framework f...
Carmel Domshlak, Steven David Prestwich, Francesca...
ICGA
2007
85views Optimization» more  ICGA 2007»
15 years 6 months ago
Searching Solitaire in Real Time
This article presents a new real-time heuristic search method for planning problems with distinct stages. Our multistage nested rollout algorithm allows the user to apply separate...
Ronald Bjarnason, Prasad Tadepalli, Alan Fern
FLAIRS
2007
15 years 9 months ago
Learning to Identify Global Bottlenecks in Constraint Satisfaction Search
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
Diarmuid Grimes, Richard J. Wallace
COMCOM
2006
100views more  COMCOM 2006»
15 years 6 months ago
Routing and wavelength assignment for core-based tree in WDM networks
In this paper, we address the routing and wavelength assignment problem for the core-based tree (CBT) service in a wavelength-division-multiplexing (WDM) network, where k sources ...
Jianping Wang, Xiangtong Qi, Mei Yang
AIPS
2008
15 years 9 months ago
Stochastic Enforced Hill-Climbing
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
Jia-Hong Wu, Rajesh Kalyanam, Robert Givan