Sciweavers

936 search results - page 149 / 188
» FSM-Hume is finite state
Sort
View
BIRTHDAY
2010
Springer
13 years 11 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe
BMCBI
2010
175views more  BMCBI 2010»
13 years 10 months ago
Global parameter estimation methods for stochastic biochemical systems
Background: The importance of stochasticity in cellular processes having low number of molecules has resulted in the development of stochastic models such as chemical master equat...
Suresh Kumar Poovathingal, Rudiyanto Gunawan
CORR
2004
Springer
177views Education» more  CORR 2004»
13 years 9 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard
TSP
2010
13 years 4 months ago
ALOHA with collision resolution (ALOHA-CR): theory and software defined radio implementation
A cross-layer scheme, namely ALOHA With Collision Resolution (ALOHA-CR), is proposed for high throughput wireless communications in a cellular scenario. Transmission occurs in a t...
Xin Liu, John Kountouriotis, Athina P. Petropulu, ...
ATAL
2006
Springer
14 years 1 months ago
Verifying space and time requirements for resource-bounded agents
The effective reasoning capability of an agent can be defined as its capability to infer, within a given space and time bound, facts that are logical consequences of its knowledge...
Natasha Alechina, Mark Jago, Piergiorgio Bertoli, ...