2398 search results - page 188 / 480 » Constraint Programming and Graph Algorithms |
163
click to vote
GD
2005
Springer
15 years 12 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
133
click to vote
DAC
2003
ACM
16 years 7 months ago
2003
ACM
Verification of system designs continues to be a major challenge today. Simulation remains the primary tool for making sure that implementations perform as they should. We present...
154
click to vote
ICSE
2008
IEEE-ACM
16 years 7 months ago
2008
IEEE-ACM
In grid workflow systems, temporal correctness is critical to assure the timely completion of grid workflow execution. To monitor and control the temporal correctness, fixed-time ...
161
click to vote
CP
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. The SEQUENCE constraint is useful in modelling car sequencing, rostering, scheduling and related problems. We introduce half a dozen new encodings of the SEQUENCE constra...
163
click to vote
CP
2004
Springer
15 years 11 months ago
2004
Springer
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...