2393 search results - page 29 / 479 » Bounds-Consistent Local Search |
KI
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
KR
2004
Springer
14 years 1 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
DAC
1999
ACM
14 years 8 months ago
1999
ACM
DAC
1999
ACM
14 years 8 months ago
1999
ACM
EVOW
2009
Springer
14 years 2 months ago
2009
Springer
The problem of finding a symmetric connectivity topology with minimum power consumption in a wireless ad-hoc network is NPhard. This work presents a new iterated local search to s...