7092 search results - page 308 / 1419 » Parallelizing constraint programs |
112
Voted
ISPD
1998
ACM
15 years 6 months ago
1998
ACM
It is shown that the oorplan area minimization problem can be formulated as a convex programming problem with the numbers of variables and constraints signi cantly less than those...
118
Voted
EP
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. Multimedia style sheet systems uniformly use a constraintbased model of layout. Constraints provide a uniform mechanism for all aspects of style management and layout and...
141
Voted
PLDI
2012
ACM
13 years 5 months ago
2012
ACM
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...
117
click to vote
EAAI
2008
15 years 2 months ago
2008
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
143
Voted
CP
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...