Sciweavers

77 search results - page 15 / 16
» Testing Basic Boolean Formulae
Sort
View
ASYNC
2000
IEEE
122views Hardware» more  ASYNC 2000»
13 years 9 months ago
DUDES: A Fault Abstraction and Collapsing Framework for Asynchronous Circuits
Fault Abstraction and Collapsing Framework for Asynchronous Circuits Philip P. Shirvani, Subhasish Mitra Center for Reliable Computing Stanford University Stanford, CA Jo C. Eberge...
Philip P. Shirvani, Subhasish Mitra, Jo C. Ebergen...
ATAL
2005
Springer
13 years 11 months ago
Dynamic epistemic logic with assignment
We add assignment operators to languages for epistemic actions, so that change of knowledge and change of facts can be combined in specifications of multi-agent system dynamics. ...
Hans P. van Ditmarsch, Wiebe van der Hoek, Barteld...
ICRA
2003
IEEE
107views Robotics» more  ICRA 2003»
13 years 10 months ago
A miniature inspection robot negotiating pipes of widely varying diameter
The purpose of this research is to realize a small robot which can negotiate pipes whose diameter varies widely during the robot’s course. A new in-pipe locomotion mechanism nam...
Koichi Suzumori, Shuichi Wakimoto, Masanori Takata
HYBRID
1998
Springer
13 years 9 months ago
A Connectionist Simulation of the Empirical Acquisition of Grammatical Relations
Abstract. This paper proposes an account of the acquisition of grammatical relations using the basic concepts of connectionism and a construction-based theory of grammar. Many prev...
William C. Morris, Garrison W. Cottrell, Jeffrey L...
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
13 years 9 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi