Sciweavers

52 search results - page 7 / 11
» Efficient Sequential and Parallel Algorithms for the Negativ...
Sort
View
126
Voted
CORR
2008
Springer
103views Education» more  CORR 2008»
15 years 2 months ago
Generating Random Graphs with Large Girth
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...
Mohsen Bayati, Andrea Montanari, Amin Saberi
94
Voted
IFIP
1994
Springer
15 years 6 months ago
Program Speedups in Theory and Practice
The aim of this discussion paper is to stimulate (or perhaps to provoke) stronger interactions among theoreticians and practitioners interested in efficient problem solutions. We ...
Neil D. Jones
150
Voted
DCOSS
2008
Springer
15 years 4 months ago
Efficient Node Discovery in Mobile Wireless Sensor Networks
Energy is one of the most crucial aspects in real deployments of mobile sensor networks. As a result of scarce resources, the duration of most real deployments can be limited to ju...
Vladimir Dyo, Cecilia Mascolo
129
Voted
ICWS
2010
IEEE
15 years 4 months ago
Highly Scalable Web Service Composition Using Binary Tree-Based Parallelization
Data intensive applications, e.g. in life sciences, pose new efficiency challenges to the service composition problem. Since today computing power is mainly increased by multiplica...
Patrick Hennig, Wolf-Tilo Balke
143
Voted
ATAL
2010
Springer
15 years 3 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein