2974 search results - page 312 / 595 » Model-Driven Constraint Programming |
174
click to vote
AI
2010
Springer
15 years 6 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 ...
167
click to vote
ECEASST
2008
15 years 6 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...
178
click to vote
JCP
2006
15 years 6 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...
172
click to vote
CONCURRENCY
2000
15 years 6 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...
181
click to vote
MP
1998
15 years 6 months ago
1998
In recent years second-order sufficient conditions of an isolated local minimizer for convex composite optimization problems have been established. In this paper, second-order opt...