Sciweavers

485 search results - page 36 / 97
» Unconstraint Assignment Problem: A Molecular Computing Appro...
Sort
View
IOR
2007
106views more  IOR 2007»
13 years 7 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
EVOW
2004
Springer
14 years 1 months ago
New Benchmark Instances for the QAP and the Experimental Analysis of Algorithms
Abstract. The quadratic assignment problem arises in a variety of practical settings. It is known to be among the hardest combinatorial problems for exact algorithms. Therefore, a ...
Thomas Stützle, Susana Fernandes

Publication
433views
14 years 4 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches for correspondence involve matching features between images. In this p...
Gemma Roig, Xavier Boix, Fernando De la Torre
JIIS
2002
141views more  JIIS 2002»
13 years 7 months ago
Combining Approximation Techniques and Vector Quantization for Adaptable Similarity Search
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining application domains including multimedia, CAD, molecular biology or medica...
Christian Böhm, Hans-Peter Kriegel, Thomas Se...
BMCBI
2008
172views more  BMCBI 2008»
13 years 7 months ago
Classification of drug molecules considering their IC50 values using mixed-integer linear programming based hyper-boxes method
Background: A priori analysis of the activity of drugs on the target protein by computational approaches can be useful in narrowing down drug candidates for further experimental t...
Pelin Armutlu, Muhittin Emre Ozdemir, Fadime Ü...