Sciweavers

4112 search results - page 37 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
128
Voted
KES
2008
Springer
15 years 3 months ago
Knowledge-based genetic algorithm for university course timetabling problems
This paper discusses a new solution to university course timetabling problems. The problems that belong to the NP-hard class are very difficult to solve using conventional optimiza...
Hitoshi Kanoh, Yuusuke Sakamoto
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
112
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
138
Voted
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 ...
134
Voted
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