Sciweavers

1220 search results - page 223 / 244
» Minimal Interval Completions
Sort
View
FOCS
2007
IEEE
16 years 15 days ago
Non-Linear Index Coding Outperforming the Linear Optimum
The following source coding problem was introduced by Birk and Kol: a sender holds a word x ∈ {0, 1}n , and wishes to broadcast a codeword to n receivers, R1, . . . , Rn. The re...
Eyal Lubetzky, Uri Stav
ICRA
2007
IEEE
160views Robotics» more  ICRA 2007»
16 years 15 days 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...
ISCA
2007
IEEE
111views Hardware» more  ISCA 2007»
16 years 14 days ago
Express virtual channels: towards the ideal interconnection fabric
Due to wire delay scalability and bandwidth limitations inherent in shared buses and dedicated links, packet-switched on-chip interconnection networks are fast emerging as the per...
Amit Kumar 0002, Li-Shiuan Peh, Partha Kundu, Nira...
MTV
2007
IEEE
121views Hardware» more  MTV 2007»
16 years 13 days ago
Chico: An On-chip Hardware Checker for Pipeline Control Logic
The widening gap between CPU complexity and verification capability is becoming increasingly more salient. It is impossible to completely verify the functionality of a modern mic...
Andrew DeOrio, Adam Bauserman, Valeria Bertacco
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
16 years 11 days ago
Encouraging Cooperation in Sharing Supermodular Costs
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
Andreas S. Schulz, Nelson A. Uhan