1017 search results - page 112 / 204 » Some existence and construction results of polygonal designs |
166
click to vote
DAC
2004
ACM
16 years 7 months ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
177
click to vote
COOPIS
1998
IEEE
15 years 10 months ago
1998
IEEE
Parallel and distributed programming is conceptually harder to undertake and to understand than sequential programming, because a programmer often has to manage the coexistence an...
160
click to vote
CCR
2004
15 years 6 months ago
2004
The tremendous popularity of wireless systems in recent years has led to the commoditization of RF transceivers (radios) whose prices have fallen dramatically. The lower cost allo...
166
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: Computational protein annotation methods occasionally introduce errors. Falsepositive (FP) errors are annotations that are mistakenly associated with a protein. Such f...
166
click to vote
COMPGEOM
2006
ACM
16 years 12 days ago
2006
ACM
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...