Sciweavers

10718 search results - page 1924 / 2144
» On the Circuit Implementation Problem
Sort
View
CAV
1999
Springer
119views Hardware» more  CAV 1999»
15 years 9 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund
FMLDO
1999
Springer
137views Database» more  FMLDO 1999»
15 years 9 months ago
Federated Transaction Management with Snapshot Isolation
Federated transaction management (also known as multidatabase transaction management in the literature) is needed to ensure the consistency of data that is distributed across mult...
Ralf Schenkel, Gerhard Weikum, Norbert Weiße...
LPAR
1999
Springer
15 years 9 months ago
Practical Reasoning for Expressive Description Logics
Abstract. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Ex...
Ian Horrocks, Ulrike Sattler, Stephan Tobies
148
Voted
RAID
1999
Springer
15 years 9 months ago
Towards trapping wily intruders in the large
The rapid increase in network bandwidth from mega bits per second to giga bits per second and potentially to tera bits per second, is making it increasingly difficult to carry out...
Glenn Mansfield
AGENTS
1998
Springer
15 years 9 months ago
A Synergy of Agent Components: Social Comparison for Failure Detection
of other components. This abstract presents an implemented illustration of such explicit component synergy and its usefulness in dynamic multi-agent environments. In such environme...
Gal A. Kaminka, Milind Tambe
« Prev « First page 1924 / 2144 Last » Next »