Sciweavers

4110 search results - page 23 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
CEC
2010
IEEE
15 years 4 months ago
A hybrid genetic algorithm and inver over approach for the travelling salesman problem
This paper proposes a two-phase hybrid approach for the travelling salesman problem (TSP). The first phase is based on a sequence based genetic algorithm (SBGA) with an embedded lo...
Shakeel Arshad, Shengxiang Yang
110
Voted
CORR
2002
Springer
111views Education» more  CORR 2002»
15 years 3 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
IJCGA
2008
114views more  IJCGA 2008»
15 years 3 months ago
Fixed Parameter Algorithms for the Minimum Weight Triangulation Problem
Published as Technical Report LU-CS-TR:2005-238 on February 13, 2006, ISSN 1650-1276 Report 158, Lund University, Sweden 2006 We discuss and compare four fixed parameter algorithm...
Magdalene G. Borgelt, Christian Borgelt, Christos ...
GLOBECOM
2007
IEEE
15 years 7 months ago
Efficient Self Protection Algorithms for Static Wireless Sensor Networks
Wireless sensor networks have been widely used in many surveillance applications. Due to the importance of sensor nodes in such applications, certain level of protection needs to b...
Yu Wang 0003, Xiang-Yang Li, Qian Zhang
170
Voted
AAAI
2008
15 years 6 months ago
An Efficient Motion Planning Algorithm for Stochastic Dynamic Systems with Constraints on Probability of Failure
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
Masahiro Ono, Brian C. Williams