2313 search results - page 304 / 463 » On Heuristic Time Hierarchies |
197
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
132
click to vote
PPOPP
2005
ACM
16 years 2 days ago
2005
ACM
Recently, system architects have built low-power, high-performance clusters, such as Green Destiny. The idea behind these clusters is to improve the energy efficiency of nodes. H...
186
click to vote
CGO
2003
IEEE
15 years 11 months ago
2003
IEEE
To meet the performance demands of modern architectures, compilers incorporate an everincreasing number of aggressive code transformations. Since most of these transformations are...
220
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
162
click to vote
INFOCOM
1999
IEEE
15 years 10 months ago
1999
IEEE
With the proliferationof multimediagroup applications, the construction of multicast trees satisfying Qualityof ServiceQoS requirementsis becominga problemof prime importance. Man...