2864 search results - page 300 / 573 » Constraint Programming in OPL |
CADE
2010
Springer
13 years 10 months ago
2010
Springer
This system description provides an overview of the MUNCH reasoner for sets and multisets. MUNCH takes as the input a formula in a logic that supports expressions about sets, multi...
AI
2010
Springer
13 years 9 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 ...
ECEASST
2008
13 years 9 months ago
2008
Executable UML allows precisely describing the software system at level of abstraction. The executable models can be translated to a less programming language completely or execute...
JCP
2006
13 years 9 months ago
2006
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
CONCURRENCY
2000
13 years 9 months ago
2000
The Java memory model described in Chapter 17 of the Java Language Specification gives constraints on how threads interact through memory. This chapter is hard to interpret and po...