Sciweavers

12519 search results - page 2125 / 2504
» Approximation Problems Categories
Sort
View
CASES
2009
ACM
15 years 4 months ago
Spatial complexity of reversibly computable DAG
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
Mouad Bahi, Christine Eisenbeis
DLS
2009
196views Languages» more  DLS 2009»
15 years 4 months ago
Contracts for first-class modules
Behavioral software contracts express properties concerning the flow of values across component (modules, classes, etc) interfaces. These properties are often beyond the reach of ...
T. Stephen Strickland, Matthias Felleisen
GECCO
2009
Springer
113views Optimization» more  GECCO 2009»
15 years 4 months ago
Single step evolution of robot controllers for sequential tasks
The generation of robot controllers for a task requiring a sequence of elementary behaviors is still a challenge. If these behaviors are known, intermediate steps can be given to ...
Stéphane Doncieux, Jean-Baptiste Mouret
180
Voted
ICCAD
2009
IEEE
92views Hardware» more  ICCAD 2009»
15 years 4 months ago
How to consider shorts and guarantee yield rate improvement for redundant wire insertion
This paper accurately considers wire short defects and proposes an algorithm to guarantee IC chip yield rate improvement for redundant wire insertion. Without considering yield ra...
Fong-Yuan Chang, Ren-Song Tsay, Wai-Kei Mak
ICCV
2009
IEEE
15 years 4 months ago
Associative hierarchical CRFs for object class image segmentation
Most methods for object class segmentation are formulated as a labelling problem over a single choice of quantisation of an image space - pixels, segments or group of segments. It...
Lubor Ladicky, Christopher Russell, Pushmeet Kohli...
« Prev « First page 2125 / 2504 Last » Next »