Sciweavers

1263 search results - page 97 / 253
» A* with Bounded Costs
Sort
View
RTAS
2006
IEEE
16 years 9 days ago
Switch Scheduling and Network Design for Real-Time Systems
The rapid need for high bandwidth and low latency communication in distributed real-time systems is driving system architects towards high-speed switches developed for high volume...
Sathish Gopalakrishnan, Marco Caccamo, Lui Sha
EMSOFT
2007
Springer
16 years 14 days ago
A dynamic scheduling approach to designing flexible safety-critical systems
The design of safety-critical systems has typically adopted static techniques to simplify error detection and fault tolerance. However, economic pressure to reduce costs is exposi...
Luís Almeida, Sebastian Fischmeister, Madhu...
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
16 years 3 months ago
On the Cell Probe Complexity of Dynamic Membership
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
KE YI, QIN ZHANG
WINE
2007
Springer
120views Economy» more  WINE 2007»
16 years 12 days ago
False-Name-Proof Mechanisms for Hiring a Team
We study the problem of hiring a team of selfish agents to perform a task. Each agent is assumed to own one or more elements of a set system, and the auctioneer is trying to purch...
Atsushi Iwasaki, David Kempe, Yasumasa Saito, Mahy...
ICALP
2010
Springer
15 years 11 months ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß