3192 search results - page 142 / 639 » The minimum latency problem |
127
click to vote
AAIM
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxi...
122
Voted
ICCAD
1994
IEEE
15 years 8 months ago
1994
IEEE
We study a new placement problem: the reproducing placement problem (RPP). In each phase a module (or gate) is decomposed into two (or more) simpler modules. The goal is nd a \go...
118
click to vote
CCCG
2009
15 years 5 months ago
2009
We model the problem of detecting intruders using a set of infrared beams by the perimeter defense problem: given a polygon P, find a minimum set of edges S of the polygon such th...
126
click to vote
TIT
2008
15 years 3 months ago
2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
115
click to vote
WABI
2005
Springer
15 years 9 months ago
2005
Springer
We present several new results pertaining to haplotyping. The first set of results concerns the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfect...