559 search results - page 27 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
ADHOCNOW
2008
Springer
14 years 1 months ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...
CSCLP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present algorithms that perform the extraction of partial assignments from binary Constraint Satisfaction Problems without introducing new constraints. They are based ...
CSCLP
2003
Springer
14 years 25 days ago
2003
Springer
Many real-life constraints describing relations between the problem variables have complex semantics and the constraint domain is defined using a table of compatible tuples rather ...
ASE
1998
13 years 7 months ago
1998
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...