Sciweavers

501 search results - page 72 / 101
» Rough Sets and Approximation Schemes
Sort
View
WEA
2007
Springer
107views Algorithms» more  WEA 2007»
14 years 4 months ago
Trunk Packing Revisited
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
Ernst Althaus, Tobias Baumann, Elmar Schömer,...
ISER
1999
Springer
112views Robotics» more  ISER 1999»
14 years 2 months ago
Models for Automated Earthmoving
Abstract: We present a composite forward model of the mechanics of an excavator backhoe digging in soil. This model is used to predict the trajectories developed by a closed-loop f...
Howard Cannon, Sanjiv Singh
ESA
2006
Springer
139views Algorithms» more  ESA 2006»
14 years 1 months ago
Stochastic Shortest Paths Via Quasi-convex Maximization
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
Evdokia Nikolova, Jonathan A. Kelner, Matthew Bran...
UAI
2008
13 years 11 months ago
Observation Subset Selection as Local Compilation of Performance Profiles
Deciding what to sense is a crucial task, made harder by dependencies and by a nonadditive utility function. We develop approximation algorithms for selecting an optimal set of me...
Yan Radovilsky, Solomon Eyal Shimony
ESA
2010
Springer
203views Algorithms» more  ESA 2010»
13 years 11 months ago
A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing
Abstract. We study the problem of designing group-strategyproof costsharing mechanisms. The players report their bids for getting serviced and the mechanism decides a set of player...
Emmanouil Pountourakis, Angelina Vidali