4451 search results - page 26 / 891 » On Random Ordering Constraints |
ICCV
2011
IEEE
13 years 11 months ago
2011
IEEE
We propose a novel framework for imposing label ordering constraints in multilabel optimization. In particular, label jumps can be penalized differently depending on the jump dire...
CADE
2004
Springer
16 years 1 days ago
2004
Springer
106
click to vote
DAWAK
2007
Springer
15 years 3 months ago
2007
Springer
Most methods for temporal pattern mining assume that time is represented by points in a straight line starting at some initial instant. In this paper, we consider a new kind of fir...
201
click to vote
CP
2009
Springer
16 years 11 days ago
2009
Springer
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
AAAI
2006
15 years 1 months ago
2006
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...