4451 search results - page 53 / 891 » On Random Ordering Constraints |
CISSE
2009
Springer
15 years 3 months ago
2009
Springer
: We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two ...
101
click to vote
ICCV
2011
IEEE
13 years 12 months ago
2011
IEEE
Many state-of-the-art segmentation algorithms rely on Markov or Conditional Random Field models designed to enforce spatial and global consistency constraints. This is often accom...
CPAIOR
2009
Springer
15 years 6 months ago
2009
Springer
Abstract: This paper introduces six ways for handling a chain of lexicographic ordering constraint between the origins of identical orthotopes (e.g., rectangles, boxes, hyper-recta...
ADHOCNOW
2008
Springer
15 years 29 days ago
2008
Springer
Abstract. We study the feasibility and time of communication in random geometric radio networks, where nodes fail randomly with positive correlation. We consider a set of radio sta...
SAC
2008
ACM
14 years 11 months ago
2008
ACM
We propose an approach that uses preferences on the constraints in order to deal with over-constrained geometric constraint problems. This approach employs constraint hierarchies,...