Sciweavers

356 search results - page 32 / 72
» Approximation schemes for the Min-Max Starting Time Problem
Sort
View
CG
2006
Springer
13 years 7 months ago
Approximate collision response using closest feature maps
In this paper we consider the novel idea of closest feature maps (CFMs) applied to refinable collision response in order to address the potential issues and problems associated wi...
Thanh Giang, Carol O'Sullivan
AAAI
2008
13 years 10 months ago
Physical Search Problems Applying Economic Search Models
This paper considers the problem of an agent searching for a resource or a tangible good in a physical environment, where at each stage of its search it observes one source where ...
Yonatan Aumann, Noam Hazon, Sarit Kraus, David Sar...
RSS
2007
151views Robotics» more  RSS 2007»
13 years 9 months ago
An Implicit Time-Stepping Method for Multibody Systems with Intermittent Contact
— In this paper we present an implicit time-stepping scheme for multibody systems with intermittent contact by incorporating the contact constraints as a set of complementarity a...
Nilanjan Chakraborty, Stephen Berard, Srinivas Ake...
COMPGEOM
2005
ACM
13 years 9 months ago
Fast construction of nets in low dimensional metrics, and their applications
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
Sariel Har-Peled, Manor Mendel
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
14 years 8 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy