405 search results - page 39 / 81 » On the Complexity of Global Constraint Satisfaction |
CPAIOR
2007
Springer
15 years 5 months ago
2007
Springer
Many optimisation problems contain substructures involving constraints on sequences of decision variables. Such constraints can be very complex to express with mixed integer progra...
FOCS
2007
IEEE
15 years 5 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
CSCLP
2006
Springer
15 years 2 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
ESOP
2003
Springer
15 years 4 months ago
2003
Springer
In complex systems, like robot plants, applications are built on top of a set of components, or devices. Each of them has particular individual constraints, and there are also log...
112
click to vote
PERCOM
2006
ACM
15 years 10 months ago
2006
ACM
Routing in multi-hop wireless networks is typically greedy, with every connection attempting to establish a path that minimizes its number of hops. However, interference plays a m...