Sciweavers

3894 search results - page 472 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
ICOIN
2004
Springer
15 years 10 months ago
Performance of New Broadcast Forwarding Criteria in MANET
In a mobile ad hoc network (MANET), packet broadcast is common and frequently used to disseminate information. Broadcast consume large amount of bandwidth resource, which is scarce...
Lijuan Zhu, Bu-Sung Lee, Boon-Chong Seet, Kai Juan...
CIAC
2006
Springer
103views Algorithms» more  CIAC 2006»
15 years 8 months ago
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
Friedrich Eisenbrand, Edda Happ
CLUSTER
2001
IEEE
15 years 8 months ago
The Master-Slave Paradigm with Heterogeneous Processors
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a po...
Olivier Beaumont, Arnaud Legrand, Yves Robert
WSC
2008
15 years 6 months ago
Dynamic entity distribution in parallel discrete event simulation
Event based simulations are an important scientific application in many fields. With the rise of cluster computing, distributed event simulation optimization becomes an essential ...
Michael Slavik, Imad Mahgoub, Ahmed Badi
COCOON
2008
Springer
15 years 6 months ago
The Computational Complexity of Link Building
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
Martin Olsen