Sciweavers

2944 search results - page 90 / 589
» Improving Bound Propagation
Sort
View
SWAT
2010
Springer
282views Algorithms» more  SWAT 2010»
14 years 3 months ago
Better Bounds on Online Unit Clustering
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...
Martin R. Ehmsen, Kim S. Larsen
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 10 months ago
On the order bound for one-point AG codes
The order bound for the minimum distance of algebraic geometry codes is defined for the dual of one-point codes. A new bound for the minimum distance of linear codes, and for codes...
Olav Geil, Carlos Munuera, Diego Ruano, Fernando T...
CPAIOR
2005
Springer
14 years 3 months ago
A Search-Infer-and-Relax Framework for Integrating Solution Methods
Abstract. We present an algorithmic framework for integrating solution methods that is based on search, inference, and relaxation and their interactions. We show that the following...
John N. Hooker
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 10 months ago
Decomposition of the NVALUE constraint
We study decompositions of the global NVALUE constraint. Our main contribution is theoretical: we show that there are propagators for global constraints like NVALUE which decomposi...
Christian Bessiere, George Katsirelos, Nina Narody...
CONSTRAINTS
2007
93views more  CONSTRAINTS 2007»
13 years 10 months ago
Arc-B-consistency of the Inter-distance Constraint
We study the “inter-distance constraint”, also known as the global minimum distance constraint, that ensures that the distance between any pair of variables is at least equal ...
Konstantin Artiouchine, Philippe Baptiste