Sciweavers

1687 search results - page 308 / 338
» On the complexity of scheduling in wireless networks
Sort
View
IPSN
2007
Springer
15 years 3 months ago
The regiment macroprogramming system
The development of high-level programming environments is essential if wireless sensor networks are to be accessible to nonexperts. In this paper, we present the Regiment system, ...
Ryan Newton, Greg Morrisett, Matt Welsh
EUROPAR
2009
Springer
15 years 4 months ago
MPI Applications on Grids: A Topology Aware Approach
Porting on grids complex MPI applications involving collective communications requires significant program modification, usually dedicated to a single grid structure. The diffi...
Camille Coti, Thomas Hérault, Franck Cappel...
ATAL
2008
Springer
14 years 11 months ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
15 years 9 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
PERCOM
2006
ACM
15 years 9 months ago
Multi-channel Protocols for Group Key Agreement in Arbitrary Topologies
We consider group key agreement (GKA) protocols, used by a group of peers to establish a shared secret key for multicast communications. There has been much previous work to impro...
Ford-Long Wong, Frank Stajano