2266 search results - page 390 / 454 » Evolutionary Algorithms for the Satisfiability Problem |
123
click to vote
NETWORKING
2004
15 years 2 months ago
2004
The next generation Internet is designed to accommodate flows that span across multiple domains with quality of service guarantees, in particular bandwidth. In this context, destin...
106
click to vote
JMM2
2007
15 years 1 months ago
2007
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
120
Voted
CP
2006
Springer
15 years 5 months ago
2006
Springer
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...
127
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
140
click to vote
ATAL
2009
Springer
15 years 8 months ago
2009
Springer
Previous work in multiagent coordination has addressed the challenge of planning in domains where agents must optimize a global goal, while satisfying local resource constraints. ...