Sciweavers

868 search results - page 2 / 174
» Finding Most Likely Solutions
Sort
View
JSAT
2008
63views more  JSAT 2008»
13 years 5 months ago
Whose side are you on? Finding solutions in a biased search-tree
We introduce a new jump strategy for look-ahead based satisfiability (Sat) solvers that aims to boost their performance on satisfiable formulae, while maintaining their behavior o...
Marijn Heule, Hans van Maaren
ECAI
2010
Springer
13 years 6 months ago
On Finding Compromise Solutions in Multiobjective Markov Decision Processes
A Markov Decision Process (MDP) is a general model for solving planning problems under uncertainty. It has been extended to multiobjective MDP to address multicriteria or multiagen...
Patrice Perny, Paul Weng
WECWIS
2002
IEEE
130views ECommerce» more  WECWIS 2002»
13 years 10 months ago
A New Category of Business Negotiation Primitives for Bilateral Negotiation Agents and Associated Algorithm to Find Pareto Optim
How to conduct automated business negotiation over the Internet is an important issue for agent research. In most bilateral negotiation models, two negotiation agents negotiate by...
Haifei Li
GECCO
2000
Springer
120views Optimization» more  GECCO 2000»
13 years 9 months ago
An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
Dan Bonachea, Eugene Ingerman, Joshua Levy, Scott ...
BMCBI
2007
144views more  BMCBI 2007»
13 years 5 months ago
Gene analogue finder: a GRID solution for finding functionally analogous gene products
Background: To date more than 2,1 million gene products from more than 100000 different species have been described specifying their function, the processes they are involved in a...
Angelica Tulipano, Giacinto Donvito, Flavio Licciu...