Sciweavers

44 search results - page 8 / 9
» Optimal Cover of Points by Disks in a Simple Polygon
Sort
View
COLT
2006
Springer
13 years 10 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
CDC
2008
IEEE
125views Control Systems» more  CDC 2008»
13 years 6 months ago
Efficient waypoint tracking hybrid controllers for double integrators using classical time optimal control
This paper is a response to requests from several respected colleagues in academia for a careful writeup of the classical time-optimal control based hybrid controllers that we have...
Haitham A. Hindi, Lara S. Crawford, Rong Zhou, Cra...
COMPGEOM
1994
ACM
13 years 10 months ago
Computing Envelopes in Four Dimensions with Applications
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
Pankaj K. Agarwal, Boris Aronov, Micha Sharir
PG
2002
IEEE
13 years 11 months ago
A Physics-Based Framework for Subdivision Surface Design with Automatic Rules Control
The recent non-uniform subdivision approach extends traditional uniform subdivision schemes with variable rules, offering additional shape parameters (such as knot spacings) for f...
Hui Xie, Hong Qin
TON
2012
11 years 8 months ago
Some Fundamental Results on Base Station Movement Problem for Wireless Sensor Networks
—The benefits of using mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem (time-dependent network to...
Yi Shi, Y. Thomas Hou