Sciweavers

227 search results - page 22 / 46
» P Systems and Finite Automata
Sort
View
DAC
1989
ACM
14 years 1 months ago
An Efficient Finite Element Method for Submicron IC Capacitance Extraction
We present an accurate and efficient method for extraction of parasitic capacitances in submicron integrated circuits. The method uses a 3-D finite element model in which the cond...
N. P. van der Meijs, Arjan J. van Genderen
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 10 months ago
Group representation design of digital signals and sequences
In this survey a novel system, called the oscillator system, consisting of order of p3 functions (signals) on the finite field Fp, is described and studied. The new functions are p...
Shamgar Gurevich, Ronny Hadani, Nir A. Sochen
LATA
2010
Springer
14 years 7 months ago
Complexity of the Satisfiability Problem for a Class of Propositional Schemata
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...
CDC
2009
IEEE
136views Control Systems» more  CDC 2009»
14 years 1 months ago
Verification of K-step opacity and analysis of its complexity
In this paper, we analyze the verification of K-step opacity in discrete event systems that are modeled as (possibly non-deterministic) finite automata with partial observation on ...
Anooshiravan Saboori, Christoforos N. Hadjicostis
FLAIRS
2001
13 years 11 months ago
Probabilistic Planning for Behavior-Based Robots
Partially Observable Markov Decision Process models (POMDPs) have been applied to low-level robot control. We show how to use POMDPs differently, namely for sensorplanning in the ...
Amin Atrash, Sven Koenig