346 search results - page 24 / 70 » Determinizing Asynchronous Automata |
ASYNC
2003
IEEE
15 years 5 months ago
2003
IEEE
Parameterized first-order models for throughput, energy, and bandwidth are presented in this paper. Models are developed for many common pipeline methodologies, including clocked...
100
click to vote
KBSE
2003
IEEE
15 years 5 months ago
2003
IEEE
Applications built in a strongly decoupled, eventbased interaction style have many commendable characteristics, including ease of dynamic configuration, accommodation of platform ...
INFOCOM
2011
IEEE
14 years 3 months ago
2011
IEEE
—We consider the problem of neighbor discovery in wireless networks with nodes operating in multiple frequency bands and with asymmetric beacon intervals. This is a challenging t...
132
click to vote
ICMLA
2004
15 years 1 months ago
2004
: The particle swarm is one of the most powerful methods for solving global optimization problems. This method is an adaptive algorithm based on social-psychological metaphor. A po...
ENTCS
2010
14 years 12 months ago
2010
Interface automata are a model that allows for the representation of stateful interfaces. In this paper we introduce a variant of interface automata, which we call interface struc...