Sciweavers

186 search results - page 36 / 38
» The Partial Augment-Relabel Algorithm for the Maximum Flow P...
Sort
View
ATAL
2008
Springer
13 years 8 months ago
On the usefulness of opponent modeling: the Kuhn Poker case study
The application of reinforcement learning algorithms to Partially Observable Stochastic Games (POSG) is challenging since each agent does not have access to the whole state inform...
Alessandro Lazaric, Mario Quaresimale, Marcello Re...
BMCBI
2005
122views more  BMCBI 2005»
13 years 6 months ago
Bayesian coestimation of phylogeny and sequence alignment
Background: Two central problems in computational biology are the determination of the alignment and phylogeny of a set of biological sequences. The traditional approach to this p...
Gerton Lunter, István Miklós, Alexei...
COMPGEOM
1994
ACM
13 years 10 months ago
Computing Envelopes in Four Dimensions with Applications
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
Pankaj K. Agarwal, Boris Aronov, Micha Sharir
AAAI
1996
13 years 8 months ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf
COR
2008
99views more  COR 2008»
13 years 6 months ago
Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing
Over the past few years, several local search algorithms have been proposed for various problems related to multicast routing in the off-line mode. We describe a population-based ...
Mohammed S. Zahrani, Martin J. Loomes, James A. Ma...