3991 search results - page 635 / 799 » Bounding homogeneous models |
DNA
2006
Springer
13 years 12 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
SWAT
2000
Springer
13 years 11 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
POPL
2010
ACM
13 years 10 months ago
2010
ACM
Angelic nondeterminism can play an important role in program development. It simplifies specifications, for example in deriving programs with a refinement calculus; it is the form...
IWMM
2010
Springer
13 years 10 months ago
2010
Springer
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
MASCOTS
2008
13 years 9 months ago
2008
Consolidation of workloads has emerged as a key mechanism to dampen the rapidly growing energy expenditure within enterprise-scale data centers. To gainfully utilize consolidation...