Sciweavers

1176 search results - page 23 / 236
» Implicit Abstraction Heuristics
Sort
View
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 10 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
AMC
2008
106views more  AMC 2008»
13 years 10 months ago
A non-binary constraint ordering heuristic for constraint satisfaction problems
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...
Miguel A. Salido
ICAI
2009
13 years 7 months ago
All-Moves-As-First Heuristics in Monte-Carlo Go
Abstract-- We present and explore the effectiveness of several variations on the All-Moves-As-First (AMAF) heuristic in Monte-Carlo Go. Our results show that:
David P. Helmbold, Aleatha Parker-Wood
CEC
2005
IEEE
14 years 3 months ago
Hybrid evolutionary static scheduling for heterogeneous systems
Abstract- The complexity of the static scheduling problem on heterogeneous resources has motivated the development of low complexity heuristics such as list scheduling. However, th...
Cristina Boeres, Eyder Rios, Luiz Satoru Ochi
CP
2000
Springer
14 years 2 months ago
New Search Heuristics for Max-CSP
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
Kalev Kask