Sciweavers

890 search results - page 60 / 178
» New Approaches to Compare Phylogenetic Search Heuristics
Sort
View
CVPR
2004
IEEE
16 years 8 months ago
Efficient Search of Faces from Complex Line Drawings
Single 2D line drawing is a straightforward method to illustrate 3D objects. The faces of an object depicted by a line drawing give very useful information for the reconstruction ...
Jianzhuang Liu, Xiaoou Tang
FLAIRS
2004
15 years 7 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar
CP
2009
Springer
16 years 1 months ago
Closing the Open Shop: Contradicting Conventional Wisdom
This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search app...
Diarmuid Grimes, Emmanuel Hebrard, Arnaud Malapert
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
15 years 9 months ago
Multi-step environment learning classifier systems applied to hyper-heuristics
Heuristic Algorithms (HA) are very widely used to tackle practical problems in operations research. They are simple, easy to understand and inspire confidence. Many of these HAs a...
Javier G. Marín-Blázquez, Sonia Schu...
BMCBI
2010
205views more  BMCBI 2010»
15 years 6 months ago
A fast indexing approach for protein structure comparison
Background: Protein structure comparison is a fundamental task in structural biology. While the number of known protein structures has grown rapidly over the last decade, searchin...
Lei Zhang, James Bailey, Arun Siddharth Konagurthu...