Sciweavers

1094 search results - page 22 / 219
» One Size Fits All
Sort
View
JDA
2006
83views more  JDA 2006»
13 years 10 months ago
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
Takehiro Ito, Xiao Zhou, Takao Nishizeki
COCO
2009
Springer
78views Algorithms» more  COCO 2009»
14 years 4 months ago
Fixed-Polynomial Size Circuit Bounds
—In 1982, Kannan showed that ΣP 2 does not have nk -sized circuits for any k. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan’s...
Lance Fortnow, Rahul Santhanam, Ryan Williams
PE
2010
Springer
114views Optimization» more  PE 2010»
13 years 8 months ago
Analysis of scheduling policies under correlated job sizes
Correlations in traffic patterns are an important facet of the workloads faced by real systems, and one that has far-reaching consequences on the performance and optimization of t...
Varun Gupta, Michelle Burroughs, Mor Harchol-Balte...
CASES
2007
ACM
14 years 1 months ago
Stack size reduction of recursive programs
For memory constrained environments like embedded systems, optimization for program size is often as important, if not more important, as optimization for execution speed. Commonl...
Stefan Schäckeler, Weijia Shang
ISSTA
2000
ACM
14 years 2 months ago
Testability, fault size and the domain-to-range ratio: An eternal triangle
A number of different concepts have been proposed that, loosely speaking, revolve around the notion of software testability. Indeed, the concept of testability itself has been int...
Martin R. Woodward, Zuhoor A. Al-Khanjari