Sciweavers

3257 search results - page 61 / 652
» Some Results on Effective Randomness
Sort
View
WEA
2004
Springer
129views Algorithms» more  WEA 2004»
15 years 3 months ago
Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
Geiza C. Silva, Luiz Satoru Ochi, Simone L. Martin...
ICRA
2000
IEEE
86views Robotics» more  ICRA 2000»
15 years 2 months ago
Randomized Planning for Short Inspection Paths
This paper addresses the following inspection problem: given a known workspace and a robot with vision capabilities compute a short path path for the robot such that each point on...
Tim Danner, Lydia E. Kavraki
APPROX
2008
Springer
88views Algorithms» more  APPROX 2008»
14 years 11 months ago
Limitations of Hardness vs. Randomness under Uniform Reductions
We consider (uniform) reductions from computing a function f to the task of distinguishing the output of some pseudorandom generator G from uniform. Impagliazzo and Wigderson [IW]...
Dan Gutfreund, Salil P. Vadhan
SIGMETRICS
2010
ACM
147views Hardware» more  SIGMETRICS 2010»
14 years 8 months ago
On random walks in direction-aware network problems
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...
Ali Tizghadam, Alberto Leon-Garcia
ATAL
2009
Springer
14 years 7 months ago
Learning to Locate Trading Partners in Agent Networks
This paper is motivated by some recent, intriguing research results involving agent-organized networks (AONs). In AONs, nodes represent agents, and collaboration between nodes are...
John Porter, Kuheli Chakraborty, Sandip Sen