Sciweavers

1257 search results - page 212 / 252
» Near-Optimal Scheduling of Distributed Algorithms
Sort
View
ISCC
2003
IEEE
130views Communications» more  ISCC 2003»
15 years 3 months ago
Congestion-Aware Multicast Routing for Supporting QoS over the Internet
Multicasting is an efficient and effective approach for supporting content distribution based on the current Internet infrastructure. In this paper, we have proposes the source-in...
Jian Zhao, Hossam S. Hassanein, Jieyi Wu, Junzhou ...
TACAS
2000
Springer
138views Algorithms» more  TACAS 2000»
15 years 1 months ago
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
This paper reports on experimental results with symbolic model checking of probabilistic processes based on Multi-Terminal Binary Decision Diagrams (MTBDDs). We consider concurrent...
Luca de Alfaro, Marta Z. Kwiatkowska, Gethin Norma...
CP
2004
Springer
15 years 3 months ago
Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
Vincent A. Cicirello, Stephen F. Smith
PPAM
2007
Springer
15 years 4 months ago
Parallel Tiled QR Factorization for Multicore Architectures
As multicore systems continue to gain ground in the High Performance Computing world, linear algebra algorithms have to be reformulated or new algorithms have to be developed in or...
Alfredo Buttari, Julien Langou, Jakub Kurzak, Jack...
SPAA
2009
ACM
15 years 10 months ago
Buffer management for colored packets with deadlines
We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of the device, i.e., the...
Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Mosci...