914 search results - page 33 / 183 » Branch and Bound on the Network Model |
CP
2008
Springer
14 years 11 months ago
2008
Springer
We propose new filtering algorithms for the SEQUENCE constraint and some extensions of the SEQUENCE constraint based on network flows. We enforce domain consistency on the SEQUENCE...
PODC
2005
ACM
15 years 3 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
COCO
2005
Springer
15 years 3 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
IPSN
2005
Springer
15 years 3 months ago
2005
Springer
We bound the number of sensors required to achieve a desired level of sensing accuracy in a discrete sensor network application (e.g. distributed detection). We model the state of...
CP
2001
Springer
15 years 2 months ago
2001
Springer
The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many rea...