Sciweavers

805 search results - page 42 / 161
» Combinatorial optimization problems in self-assembly
Sort
View
BMCBI
2006
110views more  BMCBI 2006»
13 years 11 months ago
Design of a combinatorial DNA microarray for protein-DNA interaction studies
Background: Discovery of precise specificity of transcription factors is an important step on the way to understanding the complex mechanisms of gene regulation in eukaryotes. Rec...
Julian Mintseris, Michael B. Eisen
FGCS
2000
83views more  FGCS 2000»
13 years 10 months ago
A Graph-based Ant System and its convergence
: A general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. The framework is based on the concept of a construction...
Walter J. Gutjahr
JCO
1998
136views more  JCO 1998»
13 years 10 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...
STACS
2010
Springer
14 years 4 months ago
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
Rustem Takhanov
ANOR
2005
120views more  ANOR 2005»
13 years 11 months ago
Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
Krishna Chepuri, Tito Homem-de-Mello