6110 search results - page 265 / 1222 » Approximate Computing |
189
click to vote
IJCAI
2001
15 years 8 months ago
2001
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
166
click to vote
MFCS
2007
Springer
16 years 22 days ago
2007
Springer
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
140
click to vote
IROS
2007
IEEE
16 years 27 days ago
2007
IEEE
— This paper introduces box approximations as a new tool for path planning of closed-loop linkages. Box approximations are finite collections of rectangloids that tightly envelo...
140
click to vote
ICCCN
2007
IEEE
16 years 28 days ago
2007
IEEE
—This paper presents an approach that reuses data stored in the frame memory and in the motion estimation (ME) internal buffer to avoid unnecessary memory accesses and redundant ...
163
click to vote
ADHOCNOW
2004
Springer
16 years 15 hour ago
2004
Springer
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...