Sciweavers

1884 search results - page 328 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
AIPS
2010
14 years 11 months ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...
WWW
2007
ACM
15 years 10 months ago
GigaHash: scalable minimal perfect hashing for billions of urls
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
Kumar Chellapilla, Anton Mityagin, Denis Xavier Ch...
IPPS
2009
IEEE
15 years 4 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker
RTAS
2006
IEEE
15 years 4 months ago
Zygaria: Storage Performance as a Managed Resource
Large-scale storage systems often hold data for multiple applications and users. A problem in such systems is isolating applications and users from each other to prevent their wor...
Theodore M. Wong, Richard A. Golding, Caixue Lin, ...
INFOCOM
2003
IEEE
15 years 3 months ago
Input Queued Switches: Cell Switching vs. Packet Switching
— Input Queued(IQ) switches have been very well studied in the recent past. The main problem in the IQ switches concerns scheduling. The main focus of the research has been the ï...
Yashar Ganjali, Abtin Keshavarzian, Devavrat Shah