Sciweavers

14078 search results - page 55 / 2816
» Design and Analysis of Computer Algorithms
Sort
View
138
Voted
PEWASUN
2007
ACM
15 years 3 months ago
Worst-case lifetime computation of a wireless sensor network by model-checking
Wireless Sensor Network (WSN) technology is now mature enough to be used in numerous application domains. However, due to the restricted amount of energy usually allocated to each...
Laurent Mounier, Ludovic Samper, Wassim Znaidi
120
Voted
CCGRID
2010
IEEE
15 years 3 months ago
The Effects of Untruthful Bids on User Utilities and Stability in Computing Markets
Markets of computing resources typically consist of a cluster (or a multi-cluster) and jobs that arrive over time and request computing resources in exchange for payment. In this p...
Sergei Shudler, Lior Amar, Amnon Barak, Ahuva Mu'a...
203
Voted
JMLR
2010
194views more  JMLR 2010»
14 years 9 months ago
A Statistical Implicative Analysis Based Algorithm and MMPC Algorithm for Detecting Multiple Dependencies
Discovering the dependencies among the variables of a domain from examples is an important problem in optimization. Many methods have been proposed for this purpose, but few large...
Elham Salehi, Jayashree Nyayachavadi, Robin Gras
111
Voted
ISPDC
2008
IEEE
15 years 9 months ago
Token Loss Detection for Random Walk based Algorithm
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
Thibault Bernard, Alain Bui, Devan Sohier
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 8 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang