882 search results - page 48 / 177 » Local Search for Very Large SAT Problems |
NIPS
2003
15 years 1 months ago
2003
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
100
click to vote
AAAI
2004
15 years 1 months ago
2004
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satel...
121
click to vote
SPDP
1991
IEEE
15 years 3 months ago
1991
IEEE
The parallel genetic algorithm (PGA) is a prototype of a new kind of a distributed algorithm. It is based on a parallel search by individuals all of which have the complete proble...
CEC
2010
IEEE
14 years 9 months ago
2010
IEEE
Extremal optimisation (EO) is a relatively recent nature-inspired heuristic whose search method is especially suitable to solve combinatorial optimisation problems. To date, most o...
112
click to vote
JAIR
2006
14 years 11 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...