Sciweavers

68 search results - page 13 / 14
» Integer Programming for Combinatorial Auction Winner Determi...
Sort
View
ALMOB
2006
138views more  ALMOB 2006»
13 years 5 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh
CPAIOR
2010
Springer
13 years 3 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
ECAI
2004
Springer
13 years 10 months ago
Learning Techniques for Automatic Algorithm Portfolio Selection
The purpose of this paper is to show that a well known machine learning technique based on Decision Trees can be effectively used to select the best approach (in terms of efficien...
Alessio Guerri, Michela Milano
ECR
2007
116views more  ECR 2007»
13 years 5 months ago
Enabling assisted strategic negotiations in actual-world procurement scenarios
In the everyday business world, the sourcing process of multiple goods and services usually involves complex negotiations (via telephone, fax, etc) that include discussion of prod...
Jesús Cerquides, Maite López-S&aacut...
COR
2010
177views more  COR 2010»
13 years 5 months ago
Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
Verena Schmid, Karl F. Doerner, Richard F. Hartl, ...