4524 search results - page 246 / 905 » The Complexity of Global Constraints |
148
click to vote
STACS
2005
Springer
16 years 6 days ago
2005
Springer
We provide a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is based on recent results on randomized roundings respectin...
201
click to vote
AMAI
2004
Springer
16 years 4 days ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
175
click to vote
COLT
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. We study the problem of learning partitions using equivalence constraints as input. This is a binary classification problem in the product space of pairs of datapoints. ...
191
click to vote
KR
2000
Springer
15 years 10 months ago
2000
Springer
In contrast with classical reasoning, where a solution is either correct or incorrect, approximate reasoning tries to compute solutions which are close to the ideal solution, with...
162
click to vote
DIALM
2008
ACM
15 years 8 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...