Sciweavers

4759 search results - page 358 / 952
» Parallelizing the Phylogeny Problem
Sort
View
166
Voted
PODC
2010
ACM
15 years 10 months ago
Brief announcement: exponential speed-up of local algorithms using non-local communication
We demonstrate how to leverage a system’s capability for allto-all communication to achieve an exponential speed-up of local algorithms despite bandwidth and memory restrictions...
Christoph Lenzen, Roger Wattenhofer
PODC
2010
ACM
15 years 10 months ago
Brief announcement: on the quest of optimal service ordering in decentralized queries
This paper deals with pipelined queries over services. The execution plan of such queries defines an order in which the services are called. We present the theoretical underpinni...
Efthymia Tsamoura, Anastasios Gounaris, Yannis Man...
EUROPAR
2007
Springer
15 years 10 months ago
Distributed Computation of All Node Replacements of a Minimum Spanning Tree
In many network applications the computation takes place on the minimum-cost spanning tree (MST) of the network; unfortunately, a single link or node failure disconnects the tree. ...
Paola Flocchini, Toni Mesa Enriquez, Linda Pagli, ...
GSEM
2007
Springer
15 years 10 months ago
Mapping of SLA-based Workflows with light Communication onto Grid Resources
Service Level Agreements (SLAs) are currently one of the major research topics in Grid Computing. Among those system components that support SLA-aware Grid jobs, the SLA mapping me...
Dang Minh Quan, Jörn Altmann
HPCC
2007
Springer
15 years 10 months ago
A New Method for Multi-objective TDMA Scheduling in Wireless Sensor Networks Using Pareto-Based PSO and Fuzzy Comprehensive Judg
In wireless sensor networks with many-to-one transmission mode, a multi-objective TDMA (Time Division Multiple Access) scheduling model is presented, which concerns about the packe...
Tao Wang, Zhiming Wu, Jianlin Mao