Sciweavers

990 search results - page 71 / 198
» Using evolution strategies to solve DEC-POMDP problems
Sort
View
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
14 years 1 months ago
Absolute polynomial factorization in two variables and the knapsack problem
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
Guillaume Chèze
PRICAI
1998
Springer
14 years 10 days ago
Dynamic Constraint Weighting for Over-Constrained Problems
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
John Thornton, Abdul Sattar
CHI
2010
ACM
14 years 3 months ago
Interactive effects of age and interface differences on search strategies and performance
We present results from an experiment that studied the information search behavior of younger and older adults in a medical decision-making task. To study how different combinatio...
Jessie Chin, Wai-Tat Fu
CEC
2009
IEEE
14 years 2 months ago
Task decomposition and evolvability in intrinsic evolvable hardware
— Many researchers have encountered the problem that the evolution of electronic circuits becomes exponentially more difficult when problems with an increasing number of outputs...
Tüze Kuyucu, Martin Trefzer, Julian Francis M...
AAAI
2006
13 years 9 months ago
An Asymptotically Optimal Algorithm for the Max k-Armed Bandit Problem
We present an asymptotically optimal algorithm for the max variant of the k-armed bandit problem. Given a set of k slot machines, each yielding payoff from a fixed (but unknown) d...
Matthew J. Streeter, Stephen F. Smith