1480 search results - page 198 / 296 » Ants can solve constraint satisfaction problems |
169
click to vote
DATE
2000
IEEE
15 years 11 months ago
2000
IEEE
The Boolean satisfiability problem (SAT) has various applications in electronic design automation (EDA) fields such as testing, timing analysis and logic verification. SAT has bee...
167
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
Relay power allocation has been shown to provide substantial performance gain in wireless relay networks when perfect global channel state information (CSI) is available. In this p...
173
click to vote
JNSM
2008
15 years 6 months ago
2008
There is a large conceptual gap between end-to-end infrastructure requirements and detailed component configuration implementing those requirements. Today, this gap is manually br...
178
click to vote
CSCLP
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Many agent coordination problems can be modeled as distributed constraint optimization problems (DCOPs). ADOPT is an asynchronous and distributed search algorithm that is...
202
click to vote
PLANX
2007
15 years 7 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...