Sciweavers

4066 search results - page 10 / 814
» Almost Complete Sets
Sort
View
ICMAS
1998
13 years 9 months ago
How to Explore your Opponent's Strategy (almost) Optimally
This work presents a lookahead-based exploration strategy for a model-based learning agent that enables exploration of the opponent's behavior during interaction in a multi-a...
David Carmel, Shaul Markovitch
JCO
2010
169views more  JCO 2010»
13 years 6 months ago
An almost four-approximation algorithm for maximum weight triangulation
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
Shiyan Hu
ICRA
2008
IEEE
165views Robotics» more  ICRA 2008»
14 years 2 months ago
An almost communication-less approach to task allocation for multiple Unmanned Aerial Vehicles
— In this paper, we present a scalable, decentralized task allocation algorithm for a group of unknown number of Unmanned Aerial Vehicles (UAVs), which are equipped with GPS rece...
Peng Cheng, Vijay Kumar
ESA
2008
Springer
137views Algorithms» more  ESA 2008»
13 years 9 months ago
An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
We present a new streaming algorithm for maintaining an -kernel of a point set in Rd using O((1/(d-1)/2 ) log(1/)) space. The space used by our algorithm is optimal up to a small ...
Hamid Zarrabi-Zadeh
ACL
2010
13 years 5 months ago
Inducing Domain-Specific Semantic Class Taggers from (Almost) Nothing
This research explores the idea of inducing domain-specific semantic class taggers using only a domain-specific text collection and seed words. The learning process begins by indu...
Ruihong Huang, Ellen Riloff