Sciweavers

2645 search results - page 127 / 529
» time 2003
Sort
View
UAI
2003
15 years 7 months ago
Marginalizing Out Future Passengers in Group Elevator Control
Group elevator scheduling is an NP-hard sequential decision-making problem with unbounded state spaces and substantial uncertainty. Decision-theoretic reasoning plays a surprising...
Daniel Nikovski, Matthew Brand
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
16 years 6 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
STOC
2003
ACM
109views Algorithms» more  STOC 2003»
16 years 6 months ago
Generating random regular graphs
Random regular graphs play a central role in combinatorics and theoretical computer science. In this paper, we analyze a simple algorithm introduced by Steger and Wormald [10] and...
Jeong Han Kim, Van H. Vu
APCSAC
2003
IEEE
15 years 11 months ago
L1 Cache and TLB Enhancements to the RAMpage Memory Hierarchy
The RAMpage hierarchy moves main memory up a level to replace the lowest-level cache by an equivalent-sized SRAM main memory, with a TLB caching page translations for that main mem...
Philip Machanick, Zunaid Patel
DATE
2003
IEEE
102views Hardware» more  DATE 2003»
15 years 11 months ago
Non-Enumerative Path Delay Fault Diagnosis
The first non-enumerative framework for diagnosing path delay faults using zero suppressed binary decision diagrams is introduced. We show that fault free path delay faults with ...
Saravanan Padmanaban, Spyros Tragoudas