Sciweavers

580 search results - page 44 / 116
» Approximation Algorithms for Temporal Reasoning
Sort
View
AAAI
1997
15 years 3 months ago
Model Decomposition and Simulation: A Component Based Qualitative Simulation Algorithm
Traditionally, qualitative simulation uses a global, state-based representation to describe the behavior of the modeled system. For larger, more complex systems this representatio...
Daniel J. Clancy, Benjamin Kuipers
ICCAD
2006
IEEE
141views Hardware» more  ICCAD 2006»
15 years 11 months ago
Algorithms for MIS vector generation and pruning
Ignoring the effect of simultaneous switching for logic gates causes silicon failures for high performance microprocessor designs. The main reason to omit this effect is the run...
Kenneth S. Stevens, Florentin Dartu
LOPSTR
2005
Springer
15 years 8 months ago
An Algorithm for Local Variable Elimination in Normal Logic Programs
A variable is local if it occurs in a clause body but not in its head. Local variables appear naturally in practical logic programming, but they complicate several aspects such as ...
Javier Álvez, Paqui Lucio
GIS
2002
ACM
15 years 2 months ago
Search algorithms for multiway spatial joins
This papers deals with multiway spatial joins when (i) there is limited time for query processing and the goal is to retrieve the best possible solutions within this limit (ii) the...
Dimitris Papadias, Dinos Arkoumanis
TACAS
2005
Springer
78views Algorithms» more  TACAS 2005»
15 years 8 months ago
Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems
Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumptions are specified in terms of sets of states. The analysis of fair discrete sy...
Amir Pnueli, Andreas Podelski, Andrey Rybalchenko