Sciweavers

1207 search results - page 8 / 242
» On distributed optimization using generalized gossip
Sort
View
105
Voted
TMC
2008
127views more  TMC 2008»
15 years 11 days ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik
113
Voted
ATAL
2006
Springer
15 years 4 months ago
Distributed Lagrangean relaxation protocol for the generalized mutual assignment problem
Abstract. The generalized assignment problem (GAP) is a typical NP-hard problem and has been studied for many years mainly in the operations research community. The goal of the GAP...
Katsutoshi Hirayama
106
Voted
HPCN
1995
Springer
15 years 4 months ago
Using optimistic execution techniques as a parallelisation tool for general purpose computing
Abstract. Optimistic execution techniques are widely used in the field of parallel discrete event simulation. In this paper we discuss the use of optimism as a technique for paral...
Adam Back, Stephen Turner
131
Voted
EJWCN
2010
156views more  EJWCN 2010»
14 years 7 months ago
On Performance Modeling of Ad Hoc Routing Protocols
Simulation studies have been the predominant method of evaluating ad hoc routing algorithms. Despite their wide use and merits, simulations are generally time consuming. Furthermo...
Muhammad Saleem, Syed Ali Khayam, Muddassar Farooq
119
Voted
AOSD
2009
ACM
15 years 7 months ago
Dependent advice: a general approach to optimizing history-based aspects
Many aspects for runtime monitoring are history-based: they contain pieces of advice that execute conditionally, based on the observed execution history. History-based aspects are...
Eric Bodden, Feng Chen, Grigore Rosu