Sciweavers

152 search results - page 24 / 31
» Solving hard instances of floorplacement
Sort
View
AI
2000
Springer
14 years 9 months ago
A Lagrangian reconstruction of GENET
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
Kenneth M. F. Choi, Jimmy Ho-Man Lee, Peter J. Stu...
RECOMB
2004
Springer
15 years 9 months ago
Aligning alignments exactly
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
John D. Kececioglu, Dean Starrett
IJCNLP
2005
Springer
15 years 3 months ago
Detecting Article Errors Based on the Mass Count Distinction
Abstract. This paper proposes a method for detecting errors concerning article usage and singular/plural usage based on the mass count distinction. Although the mass count distinct...
Ryo Nagata, Takahiro Wakana, Fumito Masui, Atsuo K...
82
Voted
AI
2003
Springer
15 years 2 months ago
An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem
The prediction of a protein’s structure from its amino-acid sequence is one of the most important problems in computational biology. In the current focus on a widely studied abst...
Alena Shmygelska, Holger H. Hoos
EVOW
2009
Springer
15 years 4 months ago
A Tabu Search Algorithm with Direct Representation for Strip Packing
Abstract. This paper introduces a new tabu search algorithm for a twodimensional (2D) Strip Packing Problem (2D-SPP). It integrates several key features: A direct representation of...
Jean-Philippe Hamiez, Julien Robet, Jin-Kao Hao