Sciweavers

2735 search results - page 436 / 547
» Comparing notions of randomness
Sort
View
ICGA
1997
134views Optimization» more  ICGA 1997»
14 years 4 days ago
Local Search Genetic Algorithm for Optimization of Highly Reliable Communications Networks
This paper presents a genetic algorithm (GA) with specialized encoding, initialization and local search genetic operators to optimize communication network topologies. This NPhard...
Berna Dengiz, Fulya Altiparmak, Alice E. Smith
WSC
1998
14 years 4 days ago
A Comparison of RESTART Implementations
The RESTART method is a widely applicable simulation technique for the estimation of rare event probabilities. The method is based on the idea to restart the simulation in certain...
Marnix J. J. Garvels, Dirk P. Kroese
ICGA
1993
296views Optimization» more  ICGA 1993»
14 years 3 days ago
A Genetic Algorithm Applied to the Maximum Flow Problem
A genetic algorithms is applied to find a maximum flow from the source to sink in a weighted directed graph, where the weight associated with each edge represents its flow capacit...
Toshinori Munakata, David J. Hashier
OSDI
1994
ACM
14 years 3 days ago
Lottery Scheduling: Flexible Proportional-Share Resource Management
This paper presents lottery scheduling, a novel randomized resource allocation mechanism. Lottery scheduling provides efficient, responsive control over the relative execution rat...
Carl A. Waldspurger, William E. Weihl
IJCAI
1989
13 years 12 months ago
Generation, Local Receptive Fields and Global Convergence Improve Perceptual Learning in Connectionist Networks
This paper presents and compares results for three types of connectionist networks on perceptual learning tasks: [A] Multi-layered converging networks of neuron-like units, with e...
Vasant Honavar, Leonard Uhr