2398 search results - page 340 / 480 » Constraint Programming and Graph Algorithms |
120
click to vote
CP
2007
Springer
15 years 11 months ago
2007
Springer
Shaving and constructive disjunction are two main refutation principles used in constraint programming. The shaving principle allows us to compute the singleton arc-consistency (SA...
143
click to vote
CADE
2005
Springer
16 years 5 months ago
2005
Springer
In today's society, people have very little control over what kinds of personal data are collected and stored by various agencies in both the private and public sectors. We de...
144
click to vote
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
159
click to vote
ICDCS
2005
IEEE
15 years 10 months ago
2005
IEEE
We consider distributed applications that continuously stream data across the network, where data needs to be aggregated and processed to produce a 'useful' stream of up...
128
click to vote
CPAIOR
2004
Springer
15 years 10 months ago
2004
Springer
ng Abstractions for Local Search Pascal Van Hentenryck1 and Laurent Michel2 1 Brown University, Box 1910, Providence, RI 02912 2 University of Connecticut, Storrs, CT 06269-3155 Ab...