4451 search results - page 134 / 891 » On Random Ordering Constraints |
136
click to vote
EOR
2010
15 years 1 months ago
2010
: We describe a method to find low cost shift schedules with a time-varying service level that is always above a specified minimum. Most previous approaches used a two-step procedu...
215
click to vote
CVPR
2012
IEEE
13 years 7 months ago
2012
IEEE
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...
130
Voted
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We address the problem of extracting Minimal Unsatisfiable Cores (MUCs) from constraint networks. This computationally hard problem has a practical interest in many appli...
118
Voted
COMBINATORICS
2000
15 years 4 months ago
2000
It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph Gn,p with p log n/n for any constant ...
153
click to vote
DIAGRAMS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Investigating the expressiveness of a diagrammatic logic provides insight into how its syntactic elements interact at the semantic level. Moreover, it allows for comparis...