Sciweavers

3628 search results - page 581 / 726
» Dynamic Application Structuring on Heterogeneous, Distribute...
Sort
View
SPAA
1994
ACM
15 years 9 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
139
Voted
ICASSP
2010
IEEE
15 years 5 months ago
Optimize the obvious: Automatic call flow generation
In commercial spoken dialog systems, call flows are built by call flow designers implementing a predefined business logic. While it may appear obvious from this logic how the c...
David Suendermann, Jackson Liscombe, Roberto Piera...
177
Voted
GRID
2006
Springer
15 years 5 months ago
YA: Fast and Scalable Discovery of Idle CPUs in a P2P network
Discovery of large amounts of idle CPUs in fully distributed and shared Grid systems is needed in relevant applications and is still a challenging problem. In this paper we present...
Javier Celaya, Unai Arronategui
135
Voted
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
15 years 9 months ago
The Kalman like particle filter: Optimal estimation with quantized innovations/measurements
— We study the problem of optimal estimation using quantized innovations, with application to distributed estimation over sensor networks. We show that the state probability dens...
Ravi Teja Sukhavasi, Babak Hassibi
130
Voted
ENTCS
2007
104views more  ENTCS 2007»
15 years 5 months ago
Exogenous Probabilistic Computation Tree Logic
We define a logic EpCTL for reasoning about the evolution of probabilistic systems. System states correspond to probability distributions over classical states and the system evo...
Pedro Baltazar, Paulo Mateus, Rajagopal Nagarajan,...