4451 search results - page 72 / 891 » On Random Ordering Constraints |
CP
2005
Springer
15 years 5 months ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
116
click to vote
MP
2007
14 years 11 months ago
2007
The selection of the branching variable can greatly affect the speed of the branch and bound solution of a mixed-integer or integer linear program. Traditional approaches to branc...
111
click to vote
SODA
2004
ACM
15 years 1 months ago
2004
ACM
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
120
click to vote
P2P
2010
IEEE
14 years 10 months ago
2010
IEEE
—In this paper we face the following problem: how to provide each peer local access to the full information (not just a summary) that is distributed over all edges of an overlay ...
100
click to vote
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
Markov Random Field is now ubiquitous in many formulations
of various vision problems. Recently, optimization
of higher-order potentials became practical using higherorder
graph...