230 search results - page 12 / 46 » Constraint Orbital Branching |
AI
2010
Springer
13 years 7 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
FSTTCS
2006
Springer
13 years 11 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...
GRAPHICSINTERFACE
1997
13 years 9 months ago
1997
We present a modelling method and graphical user interface for the creation of natural branching structures such as plants. Structural and geometric information is encapsulated in...
CP
2001
Springer
14 years 4 days ago
2001
Springer
The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many rea...
CP
2008
Springer
13 years 9 months ago
2008
Springer
We propose new filtering algorithms for the SEQUENCE constraint and some extensions of the SEQUENCE constraint based on network flows. We enforce domain consistency on the SEQUENCE...