Sciweavers

484 search results - page 95 / 97
» The number of convex permutominoes
Sort
View
ATAL
2008
Springer
13 years 9 months ago
Adaptive multi-robot wide-area exploration and mapping
The exploration problem is a central issue in mobile robotics. A complete terrain coverage is not practical if the environment is large with only a few small hotspots. This paper ...
Kian Hsiang Low, John M. Dolan, Pradeep K. Khosla
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
13 years 8 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
ALENEX
2008
180views Algorithms» more  ALENEX 2008»
13 years 8 months ago
Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing
The National Airspace System (NAS) is designed to accommodate a large number of flights over North America. For purposes of workload limitations for air traffic controllers, the a...
Amitabh Basu, Joseph S. B. Mitchell, Girishkumar S...
IJCAI
2007
13 years 8 months ago
Spiteful Bidding in Sealed-Bid Auctions
We study the bidding behavior of spiteful agents who, contrary to the common assumption of selfinterest, maximize a convex combination of their own proļ¬t and their competitorsā€...
Felix Brandt, Tuomas Sandholm, Yoav Shoham
NIPS
2007
13 years 8 months ago
A New View of Automatic Relevance Determination
Automatic relevance determination (ARD) and the closely-related sparse Bayesian learning (SBL) framework are effective tools for pruning large numbers of irrelevant features leadi...
David P. Wipf, Srikantan S. Nagarajan