Sciweavers

15421 search results - page 2688 / 3085
» Dependability
Sort
View
SAT
2007
Springer
118views Hardware» more  SAT 2007»
16 years 1 months ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov
SEMWEB
2007
Springer
16 years 1 months ago
Semantic Cooperation and Knowledge Reuse by Using Autonomous Ontologies
Several proposals have been put forward to support distributed agent cooperation in the Semantic Web, by allowing concepts and roles in one ontology be reused in another ontology. ...
Yuting Zhao, Kewen Wang, Rodney W. Topor, Jeff Z. ...
SMALLTALK
2007
Springer
16 years 1 months ago
Transactional memory for smalltalk
Concurrency control in Smalltalk is based on locks and is therefore notoriously difficult to use. Even though some implementations provide high-level constructs, these add complexi...
Lukas Renggli, Oscar Nierstrasz
STACS
2007
Springer
16 years 1 months ago
Testing Convexity Properties of Tree Colorings
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
Eldar Fischer, Orly Yahalom
TACAS
2007
Springer
99views Algorithms» more  TACAS 2007»
16 years 1 months ago
"Don't Care" Modeling: A Logical Framework for Developing Predictive System Models
Analysis of biological data often requires an understanding of components of pathways and/or networks and their mutual dependency relationships. Such systems are often analyzed and...
Hillel Kugler, Amir Pnueli, Michael J. Stern, E. J...
« Prev « First page 2688 / 3085 Last » Next »