Sciweavers

235 search results - page 25 / 47
» A Logical Characterization of Individual-Based Models
Sort
View
FOSSACS
1999
Springer
14 years 23 days ago
A Strong Logic Programming View for Static Embedded Implications
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...
R. Arruabarrena, Paqui Lucio, Marisa Navarro
ICML
1999
IEEE
14 years 9 months ago
Abstracting from Robot Sensor Data using Hidden Markov Models
ing from Robot Sensor Data using Hidden Markov Models Laura Firoiu, Paul Cohen Computer Science Department, LGRC University of Massachusetts at Amherst, Box 34610 Amherst, MA 01003...
Laura Firoiu, Paul R. Cohen
STACS
1994
Springer
14 years 16 days ago
Reachability and the Power of Local Ordering
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
Kousha Etessami, Neil Immerman
TVLSI
2002
93views more  TVLSI 2002»
13 years 8 months ago
Simultaneous switching noise in on-chip CMOS power distribution networks
Simultaneous switching noise (SSN) has become an important issue in the design of the internal on-chip power distribution networks in current very large scale integration/ultra lar...
Kevin T. Tang, Eby G. Friedman
ECAI
2006
Springer
14 years 4 days ago
CTL Model Update: Semantics, Computations and Implementation
Minimal change is a fundamental principle for modeling system dynamics. In this paper, we study the issue of minimal change for Computational Tree Logic (CTL) model update. We firs...
Yulin Ding, Yan Zhang