Sciweavers

1186 search results - page 200 / 238
» State machine models of timing and circuit design
Sort
View
ATVA
2005
Springer
132views Hardware» more  ATVA 2005»
14 years 1 months ago
Flat Counter Automata Almost Everywhere!
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
Jérôme Leroux, Grégoire Sutre
WOA
2010
13 years 5 months ago
Programming Wireless Body Sensor Network Applications through Agents
Wireless Sensor Networks (WSNs) are currently emerging as one of the most disruptive technologies enabling and supporting next generation ubiquitous and pervasive computing scenari...
Giancarlo Fortino, Stefano Galzarano
PIMRC
2008
IEEE
14 years 2 months ago
Carrier frequency dependent throughput analysis for impaired OFDM links under user mobility
—In this paper we present an analytical approach to evaluate the M-QAM bit error rate and carrier frequency dependent throughput of OFDM systems subject to various receiver impai...
Marco Krondorf, Gerhard Fettweis
INFOCOM
2007
IEEE
14 years 2 months ago
Cost and Collision Minimizing Forwarding Schemes for Wireless Sensor Networks
—The paper presents a novel integrated MAC/routing scheme for wireless sensor networking. Our design objective is to elect the next hop for data forwarding by minimizing the numb...
Michele Rossi, Nicola Bui, Michele Zorzi
LCTRTS
2004
Springer
14 years 1 months ago
Flattening statecharts without explosions
We present a polynomial upper bound for flattening of UML statecharts. An efficient flattening technique is derived and implemented in SCOPE—a code generator targeting constra...
Andrzej Wasowski