100 search results - page 15 / 20 » Solving the minimum-cost satisfiability problem using SAT ba... |
CP
2006
Springer
13 years 11 months ago
2006
Springer
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...
ACMICEC
2004
ACM
14 years 27 days ago
2004
ACM
In this paper, we describe the operation of barter trade exchanges by identifying key techniques used by trade brokers to stimulate trade and satisfy member needs, and present alg...
SPIRE
2005
Springer
14 years 28 days ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
AB
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Haplotype inference from genotype data is a key computational problem in bioinformatics, since retrieving directly haplotype information from DNA samples is not feasible ...
ITSSA
2006
13 years 7 months ago
2006
: Stakeholder search is a general framework for an extension to the improving on the competition approach paradigm for cooperative search that allows for additional individual goal...