Sciweavers

2479 search results - page 249 / 496
» Random Event Structures
Sort
View
GECCO
2000
Springer
120views Optimization» more  GECCO 2000»
15 years 10 months ago
An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
Dan Bonachea, Eugene Ingerman, Joshua Levy, Scott ...
SODA
2008
ACM
95views Algorithms» more  SODA 2008»
15 years 8 months ago
Concatenated codes can achieve list-decoding capacity
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 6 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli
EJC
2007
15 years 6 months ago
Online balanced graph avoidance games
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
Martin Marciniszyn, Dieter Mitsche, Milos Stojakov...
CMOT
1999
105views more  CMOT 1999»
15 years 6 months ago
Friendship Networks Through Time: An Actor-Oriented Dynamic Statistical Network Model
We propose a class of actor-oriented statistical models for closed social networks in general, and friendship networks in particular. The models are random utility models develope...
Gerhard G. Van De Bunt, Marijtje A. J. Van Duijn, ...