1024 search results - page 163 / 205 » Value complete, column complete, predicate complete |
145
click to vote
CONCUR
2012
Springer
13 years 6 months ago
2012
Springer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and ...
160
click to vote
AAIM
2007
Springer
15 years 10 months ago
2007
Springer
Packet scheduling in networks with quality of service constraints has been extensively studied as a single criterion scheduling problem. The assumption underlying single criterion ...
170
click to vote
CAD
2004
Springer
15 years 4 months ago
2004
Springer
Solid modeling based on partial differential equations (PDEs) can potentially unify both geometric constraints and functional requirements within a single design framework to mode...
139
click to vote
KAIS
2011
14 years 11 months ago
2011
Abstract. Hunter and Konieczny explored the relationships between measures of inconsistency for a belief base and the minimal inconsistent subsets of that belief base in several of...
139
click to vote
LICS
2006
IEEE
15 years 10 months ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...