Sciweavers

17 search results - page 3 / 4
» An exact algorithm for the robust shortest path problem with...
Sort
View
FOCS
2005
IEEE
13 years 11 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
ESA
2006
Springer
92views Algorithms» more  ESA 2006»
13 years 9 months ago
Out-of-Order Event Processing in Kinetic Data Structures
We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...
Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg...
AMAI
2005
Springer
13 years 5 months ago
Robust inference of trees
Abstract. This paper is concerned with the reliable inference of optimal treeapproximations to the dependency structure of an unknown distribution generating data. The traditional ...
Marco Zaffalon, Marcus Hutter
COMPGEOM
2004
ACM
13 years 9 months ago
Continuous path verification in multi-axis NC-machining
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter conti...
Ron Wein, Oleg Ilushin, Gershon Elber, Dan Halperi...
MOBIHOC
2005
ACM
14 years 5 months ago
Localization and routing in sensor networks by local angle information
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
Jehoshua Bruck, Jie Gao, Anxiao Jiang