2108 search results - page 124 / 422 » Constrained Heuristic Search |
134
click to vote
FLAIRS
2007
15 years 4 months ago
2007
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...
ESA
2008
Springer
15 years 3 months ago
2008
Springer
The focus is on black-box optimization of a function f : RN R given as a black box, i. e. an oracle for f-evaluations. This is commonly called direct search, and in fact, most meth...
123
Voted
NETWORKS
2007
15 years 1 months ago
2007
The Internet Protocol Network Design Problem with Reliability and Routing Constraints (IPRR) can be shortly stated as follows. A telecommunication network is given in terms of a s...
103
click to vote
AAAI
2008
15 years 4 months ago
2008
Recent advances in classical planning have used the SAS+ formalism, and several effective heuristics have been developed based on the SAS+ formalism. Comparing to the traditional ...
SAC
2009
ACM
15 years 8 months ago
2009
ACM
In this work, our objective is to heuristically discover a simplified form of functional dependencies between variables called weak dependencies. Once discovered, these relations...