Sciweavers

770 search results - page 102 / 154
» Toward an Optimal Redundancy Strategy for Distributed Comput...
Sort
View
125
Voted
ICDCS
2010
IEEE
15 years 5 months ago
Minimizing Probing Cost and Achieving Identifiability in Network Link Monitoring
Continuously monitoring the link performance is important to network diagnosis. Recently, active probes sent between end systems are widely used to monitor the link performance. I...
Qiang Zheng, Guohong Cao
128
Voted
CORR
2008
Springer
126views Education» more  CORR 2008»
15 years 3 months ago
One shot schemes for decentralized quickest change detection
This work considers the problem of quickest detection with N distributed sensors that receive sequential observations either in discrete or in continuous time from the environment....
Olympia Hadjiliadis, Hongzhong Zhang, H. Vincent P...
98
Voted
GECCO
2010
Springer
152views Optimization» more  GECCO 2010»
15 years 7 months ago
Active covariance matrix adaptation for the (1+1)-CMA-ES
We propose a novel variant of the (1 + 1)-CMA-ES that updates the distribution of mutation vectors based on both successful and unsuccessful trial steps. The computational costs o...
Dirk V. Arnold, Nikolaus Hansen
176
Voted
ATAL
2007
Springer
15 years 7 months ago
A unified framework for multi-agent agreement
Multi-Agent Agreement problems (MAP) - the ability of a population of agents to search out and converge on a common state - are central issues in many multi-agent settings, from d...
Kiran Lakkaraju, Les Gasser
ASAP
2007
IEEE
136views Hardware» more  ASAP 2007»
15 years 10 months ago
0/1 Knapsack on Hardware: A Complete Solution
We present a memory efficient, practical, systolic, parallel architecture for the complete 0/1 knapsack dynamic programming problem, including backtracking. This problem was inte...
K. Nibbelink, S. Rajopadhye, R. McConnell