Sciweavers

580 search results - page 71 / 116
» Approximation Algorithms for Temporal Reasoning
Sort
View
AAAI
2008
15 years 4 months ago
Factored Models for Probabilistic Modal Logic
Modal logic represents knowledge that agents have about other agents' knowledge. Probabilistic modal logic further captures probabilistic beliefs about probabilistic beliefs....
Afsaneh Shirazi, Eyal Amir
202
Voted
GIS
2006
ACM
16 years 3 months ago
ST-ACTS: a spatio-temporal activity simulator
Creating complex spatio?temporal simulation models is a hot issue in the area of spatio?temporal databases [7]. While existing Moving Object Simulators (MOSs) address different ph...
Gyözö Gidófalvi, Torben Bach Pede...
FAST
2004
15 years 3 months ago
CAR: Clock with Adaptive Replacement
CLOCK is a classical cache replacement policy dating back to 1968 that was proposed as a low-complexity approximation to LRU. On every cache hit, the policy LRU needs to move the a...
Sorav Bansal, Dharmendra S. Modha
122
Voted
CAV
2004
Springer
126views Hardware» more  CAV 2004»
15 years 6 months ago
An Efficiently Checkable, Proof-Based Formulation of Vacuity in Model Checking
Model checking algorithms can report a property as being true for reasons that may be considered vacuous. Current algorithms for detecting vacuity require either checking a quadrat...
Kedar S. Namjoshi
96
Voted
PLILP
1993
Springer
15 years 6 months ago
Higher-Order Chaotic Iteration Sequences
Chaotic iteration sequences is a method for approximating fixpoints of monotonic functions proposed by Patrick and Radhia Cousot. It may be used in specialisation algorithms for ...
Mads Rosendahl