2109 search results - page 100 / 422 » Solving Necklace Constraint Problems |
140
Voted
EOR
2007
15 years 4 months ago
2007
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...
101
click to vote
EMNLP
2008
15 years 6 months ago
2008
We introduce a method for solving substitution ciphers using low-order letter n-gram models. This method enforces global constraints using integer programming, and it guarantees t...
118
click to vote
SIAMJO
2008
15 years 4 months ago
2008
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...
147
click to vote
ICCV
2009
IEEE
16 years 10 months ago
2009
IEEE
Finding correspondences between feature points is one
of the most relevant problems in the whole set of visual
tasks. In this paper we address the problem of matching
a feature ...
135
click to vote
PERCOM
2006
ACM
16 years 4 months ago
2006
ACM
In this paper, we study the problem of utility maximization in multi-hop wireless systems. To study the effect of wireless interference constraints on the utility maximization pro...