Sciweavers

1839 search results - page 349 / 368
» Models of Coordination
Sort
View
MOBIHOC
2008
ACM
14 years 7 months ago
Efficient binary schemes for training heterogeneous sensor and actor networks
Sensor networks are expected to evolve into long-lived, autonomous networked systems whose main mission is to provide in-situ users ? called actors ? with real-time information in...
Ferruccio Barsi, Alfredo Navarra, Maria Cristina P...
MOBIHOC
2005
ACM
14 years 7 months ago
Localization and routing in sensor networks by local angle information
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
ASPLOS
2010
ACM
14 years 2 months ago
Flexible architectural support for fine-grain scheduling
To make efficient use of CMPs with tens to hundreds of cores, it is often necessary to exploit fine-grain parallelism. However, managing tasks of a few thousand instructions is ...
Daniel Sanchez, Richard M. Yoo, Christos Kozyrakis
ISBI
2009
IEEE
14 years 2 months ago
Posture Matching and Elastic Registration of a Mouse Atlas to Surface Topography Range Data
Estimation of internal mouse anatomy is required for quantitative bioluminescence or fluorescence tomography. However, only surface range data can be recovered from all-optical s...
Anand Joshi, Abhijit Chaudhari, Changqing Li, Davi...
SAGT
2009
Springer
136views Game Theory» more  SAGT 2009»
14 years 2 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