Sciweavers

1041 search results - page 131 / 209
» Randomizing Reductions of Search Problems
Sort
View
CCR
2006
117views more  CCR 2006»
13 years 8 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
IJHIS
2007
89views more  IJHIS 2007»
13 years 7 months ago
A new hybrid heuristic for driver scheduling
This paper describes a new hybrid method based on the application of the Population Training Algorithm (PTA) and linear programming (LP) for generation of schedules for drivers in...
Geraldo R. Mauri, Luiz Antonio Nogueira Lorena
GECCO
2007
Springer
124views Optimization» more  GECCO 2007»
14 years 2 months ago
Origin of bursts
The phenomenon of particle bursts, a well-known feature of PSO is investigated. Their origin is concluded to lie in multiplicative stochasticity, previously encountered in the stu...
Tim Blackwell, Daniel Bratton
SIAMDM
2010
136views more  SIAMDM 2010»
13 years 2 months ago
Obnoxious Centers in Graphs
We consider the problem of finding obnoxious centers in graphs. For arbitrary graphs with n vertices and m edges, we give a randomized algorithm with O(n log2 n + m log n) expecte...
Sergio Cabello, Günter Rote
COR
2006
122views more  COR 2006»
13 years 8 months ago
Multiple task assignments for cooperating uninhabited aerial vehicles using genetic algorithms
A problem of assigning cooperating uninhabited aerial vehicles to perform multiple tasks on multiple targets is posed as a new combinatorial optimization problem. A genetic algori...
Tal Shima, Steven J. Rasmussen, Andrew G. Sparks, ...