Sciweavers

376 search results - page 36 / 76
» Approximating Probability Distributions Using Small Sample S...
Sort
View
TEC
2008
118views more  TEC 2008»
13 years 7 months ago
RM-MEDA: A Regularity Model-Based Multiobjective Estimation of Distribution Algorithm
Under mild conditions, it can be induced from the Karush-Kuhn-Tucker condition that the Pareto set, in the decision space, of a continuous multiobjective optimization problem is (m...
Qingfu Zhang, Aimin Zhou, Yaochu Jin
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 7 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
JIRS
2007
108views more  JIRS 2007»
13 years 7 months ago
GODZILA: A Low-resource Algorithm for Path Planning in Unknown Environments
— In this paper, we propose a novel path-planning and obstacle avoidance algorithm GODZILA for navigation in unknown environments. No prior knowledge of the environment is requir...
Prashanth Krishnamurthy, Farshad Khorrami
OPODIS
2007
13 years 9 months ago
Peer to Peer Multidimensional Overlays: Approximating Complex Structures
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way tha...
Olivier Beaumont, Anne-Marie Kermarrec, Etienne Ri...
CORR
2012
Springer
228views Education» more  CORR 2012»
12 years 3 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled