2911 search results - page 466 / 583 » A Logic of Graph Constraints |
135
Voted
COCOS
2003
Springer
15 years 5 months ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
214
Voted
LCC
1994
15 years 4 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
CLUSTER
2004
IEEE
15 years 4 months ago
2004
IEEE
The Rocks toolkit [9], [7], [10] uses a graph-based framework to describe the configuration of all node types (termed appliances) that make up a complete cluster. With hundreds of...
119
Voted
SIGSOFT
2003
ACM
16 years 1 months ago
2003
ACM
This paper presents a novel approach for automated test data generation of imperative programs containing integer, boolean and/or float variables. It extends our previous work to ...
116
click to vote
SPAA
2005
ACM
15 years 6 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...