Sciweavers

2266 search results - page 150 / 454
» Some Solutions to the Ignoring Problem
Sort
View
ECAI
2004
Springer
15 years 12 months ago
Multiple Relaxations in Temporal Planning
CRIKEY is a planner that separates out the scheduling from the classical parts of temporal planning. This can be seen as a relaxation of the temporal information during the classic...
Keith Halsey, Derek Long, Maria Fox
INFOCOM
2002
IEEE
15 years 11 months ago
FPAC: Fast, Fixed-Cost Authentication for Access to Reserved Resources
—Enhanced network services often involve allocating resources (bandwidth/buffer space) preferentially to packets belonging to certain flows or traffic classes. Such services ar...
Kenneth L. Calvert, Srinivasan Venkatraman, Jim Gr...
DKE
2007
156views more  DKE 2007»
15 years 6 months ago
Efficient index and data allocation for wireless broadcast services
The periodic broadcasting of frequently requested data can reduce the workload of uplink channels and improve data access for users in a wireless network. Since mobile devices hav...
Shou-Chih Lo, Arbee L. P. Chen
TC
2002
15 years 6 months ago
Fast Asynchronous Uniform Consensus in Real-Time Distributed Systems
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...
Jean-François Hermant, Gérard Le Lan...
NIPS
2007
15 years 8 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola