Sciweavers

380 search results - page 42 / 76
» Operation-valency and the cost of coordination
Sort
View
NETWORK
2007
167views more  NETWORK 2007»
13 years 8 months ago
Sensor Localization under Limited Measurement Capabilities
If we abstract a sensor network as a network graph consisting of vertices and edges, where vertices represent sensor nodes and edges represent distance measurements between neighbo...
Chen Wang, Li Xiao
SIGMOD
2012
ACM
253views Database» more  SIGMOD 2012»
11 years 11 months ago
Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...
Andrew Pavlo, Carlo Curino, Stanley B. Zdonik
ICRA
2007
IEEE
160views Robotics» more  ICRA 2007»
14 years 3 months ago
Adaptive Sampling for Multi-Robot Wide-Area Exploration
— The exploration problem is a central issue in mobile robotics. A complete coverage is not practical if the environment is large with a few small hotspots, and the sampling cost...
Kian Hsiang Low, Geoffrey J. Gordon, John M. Dolan...
SAGT
2009
Springer
136views Game Theory» more  SAGT 2009»
14 years 3 months ago
Non-clairvoyant Scheduling Games
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
Christoph Dürr, Nguyen Kim Thang
AGENTS
2001
Springer
14 years 1 months ago
Adjustable autonomy in real-world multi-agent environments
Through adjustable autonomy (AA), an agent can dynamically vary the degree to which it acts autonomously, allowing it to exploit human abilities to improve its performance, but wi...
Paul Scerri, David V. Pynadath, Milind Tambe