Sciweavers

15485 search results - page 2763 / 3097
» Computing Optimal Subsets
Sort
View
WADS
1997
Springer
91views Algorithms» more  WADS 1997»
15 years 11 months ago
Dynamic Motion Planning in Low Obstacle Density Environments
A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. ...
Robert-Paul Berretty, Mark H. Overmars, A. Frank v...
ICCAD
1993
IEEE
104views Hardware» more  ICCAD 1993»
15 years 10 months ago
Parallel timing simulation on a distributed memory multiprocessor
Circuit simulation is one of the most computationally expensive tasks in circuit design and optimization. Detailed simulation at the level of precision of SPICE is usually perform...
Chih-Po Wen, Katherine A. Yelick
ICCAD
1994
IEEE
144views Hardware» more  ICCAD 1994»
15 years 10 months ago
Power analysis of embedded software: a first step towards software power minimization
Embedded computer systems are characterized by the presence of a dedicated processor and the software that runs on it. Power constraints are increasingly becoming the critical com...
Vivek Tiwari, Sharad Malik, Andrew Wolfe
COLT
1993
Springer
15 years 10 months ago
Learning Binary Relations Using Weighted Majority Voting
In this paper we demonstrate how weighted majority voting with multiplicative weight updating can be applied to obtain robust algorithms for learning binary relations. We first pre...
Sally A. Goldman, Manfred K. Warmuth
COMPGEOM
1993
ACM
15 years 10 months ago
Approximating Center Points with Iterated Radon Points
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
Kenneth L. Clarkson, David Eppstein, Gary L. Mille...
« Prev « First page 2763 / 3097 Last » Next »