3820 search results - page 636 / 764 » Bounded Model Debugging |
125
click to vote
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
114
click to vote
PDCAT
2005
Springer
15 years 7 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
100
Voted
SEMWEB
2005
Springer
15 years 7 months ago
2005
Springer
This paper extends the model theory of RDF with rules, placing an emphasis on integration with OWL and decidability of entailstart from an abstract syntax that views a rule as a pa...
146
click to vote
SSD
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Evacuation planning is critical for numerous important applications, e.g. disaster emergency management and homeland defense preparation. Efficient tools are needed to pr...
125
click to vote
WEA
2005
Springer
15 years 7 months ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...