1884 search results - page 259 / 377 » Simple Algorithm for Simple Timed Games |
147
click to vote
HPDC
2007
IEEE
15 years 11 months ago
2007
IEEE
Utility functions can be used to represent the value users attach to job completion as a function of turnaround time. Most previous scheduling research used simple synthetic repre...
168
click to vote
DAGSTUHL
1996
15 years 6 months ago
1996
An analysis method for specialization of imperative programs is described in this paper. This analysis is an inter-procedural data flow method operating on control flow graphs and...
189
click to vote
COMGEO
2011
ACM
14 years 11 months ago
2011
ACM
A set of planar graphs share a simultaneous embedding if they can be drawn on the same vertex set V in the Euclidean plane without crossings between edges of the same graph. Fixed ...
144
click to vote
COMPGEOM
1992
ACM
15 years 8 months ago
1992
ACM
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
152
click to vote
IM
2007
15 years 6 months ago
2007
— We consider whether the off-line compilation of a set of Service Level Agreements (SLAs) into low-level management policies can lead to the runtime maximization of the overall ...