Sciweavers

12825 search results - page 172 / 2565
» Improved PLSOM algorithm
Sort
View
BMCBI
2005
125views more  BMCBI 2005»
15 years 5 months ago
DIALIGN-T: An improved algorithm for segment-based multiple sequence alignment
Background: We present a complete re-implementation of the segment-based approach to multiple protein alignment that contains a number of improvements compared to the previous ver...
Amarendran R. Subramanian, Jan Weyer-Menkhoff, Mic...
ATAL
2008
Springer
15 years 7 months ago
An improved dynamic programming algorithm for coalition structure generation
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of partitioning the set of agents into exh...
Talal Rahwan, Nicholas R. Jennings
117
Voted
FOCS
1993
IEEE
15 years 9 months ago
An On-Line Algorithm for Improving Performance in Navigation
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
Avrim Blum, Prasad Chalasani
129
Voted
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
15 years 6 months ago
An improved approximation algorithm for the partial latin square extension problem
Previous work on the partial Latin square extension (PLSE) problem resulted in a 2-approximation algorithm based on the LP relaxation of a three-dimensional assignment IP formulat...
Carla P. Gomes, Rommel G. Regis, David B. Shmoys
IJIT
2004
15 years 6 months ago
Restartings: A Technique to Improve Classic Genetic Algorithms' Performance
In this contribution, a way to enhance the performance of the classic Genetic Algorithm is proposed. The idea of restarting a Genetic Algorithm is applied in order to obtain better...
Grigorios N. Beligiannis, Georgios A. Tsirogiannis...