692 search results - page 28 / 139 » BDD minimization for approximate computing |
115
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—This paper considers the design of opportunistic packet schedulers for users sharing a time-varying wireless channel from the performance and the robustness points of view. Firs...
83
Voted
ICPR
2006
IEEE
16 years 3 months ago
2006
IEEE
In this paper, a digital planar curve approximation method based on a multi-objective genetic algorithm is proposed. In this method, the optimization/exploration algorithm locates...
162
Voted
FOCS
2005
IEEE
15 years 7 months ago
2005
IEEE
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...
104
click to vote
GREC
2005
Springer
15 years 7 months ago
2005
Springer
This paper presents a method of parameterization for online freehand drawing objects based on a piecewise cubic Bezier curve approximation. The target is to represent sketches in a...
156
click to vote
ALGORITHMICA
2011
14 years 9 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...