1453 search results - page 170 / 291 » Partial Constraint Satisfaction |
141
click to vote
FSTTCS
2006
Springer
15 years 8 months ago
2006
Springer
In recent papers, the partial order reduction approach has been adapted to reason about the probabilities for temporal properties in concurrent systems with probabilistic behaviour...
143
click to vote
ECCV
1998
Springer
16 years 6 months ago
1998
Springer
Assume that some objects are present in an image but can be seen only partially and are overlapping each other. To recognize the objects, we have to rstly separate the objects from...
109
Voted
SAC
2009
ACM
15 years 11 months ago
2009
ACM
In this work, our objective is to heuristically discover a simplified form of functional dependencies between variables called weak dependencies. Once discovered, these relations...
138
Voted
CPAIOR
2007
Springer
15 years 10 months ago
2007
Springer
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
186
click to vote
CIMCA
2006
IEEE
15 years 10 months ago
2006
IEEE
Business Process Management (BPM) is often a key component of the business change. Business rules, whether embedded within BPM or on their own, have begun playing an ever-increasi...