Sciweavers

10054 search results - page 1937 / 2011
» On the Complexity of Function Learning
Sort
View
SCAM
2006
IEEE
15 years 9 months ago
Bug Classification Using Program Slicing Metrics
In this paper, we introduce 13 program slicing metrics for C language programs. These metrics use program slice information to measure the size, complexity, coupling, and cohesion...
Kai Pan, Sunghun Kim, E. James Whitehead Jr.
153
Voted
ASPLOS
2006
ACM
15 years 9 months ago
Combinatorial sketching for finite programs
Sketching is a software synthesis approach where the programmer develops a partial implementation — a sketch — and a separate specification of the desired functionality. The ...
Armando Solar-Lezama, Liviu Tancau, Rastislav Bod&...
CASES
2006
ACM
15 years 9 months ago
Integrated scratchpad memory optimization and task scheduling for MPSoC architectures
Multiprocessor system-on-chip (MPSoC) is an integrated circuit containing multiple instruction-set processors on a single chip that implements most of the functionality of a compl...
Vivy Suhendra, Chandrashekar Raghavan, Tulika Mitr...
COMPGEOM
2006
ACM
15 years 9 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
165
Voted
PODC
2006
ACM
15 years 9 months ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...
« Prev « First page 1937 / 2011 Last » Next »