Sciweavers

198 search results - page 12 / 40
» Anytime Bounded Rationality
Sort
View
71
Voted
FFA
2007
56views more  FFA 2007»
14 years 9 months ago
Optical orthogonal codes and arcs in PG(d, q)
We present a new construction for (n, w, λ)-optical orthogonal codes (OOCs). The construction is pleasingly simple, where codewords correspond to arcs, specifically normal ratio...
T. L. Alderson
61
Voted
ANTS
2006
Springer
79views Algorithms» more  ANTS 2006»
15 years 1 months ago
Computing a Lower Bound for the Canonical Height on Elliptic Curves over Q
Let E be an elliptic curve over the rationals. A crucial step in determining a Mordell-Weil basis for E is to exhibit some positive lower bound > 0 for the canonical height ^h ...
John Cremona, Samir Siksek
AIMSA
2004
Springer
15 years 1 months ago
Towards Well-Defined Multi-agent Reinforcement Learning
Multi-agent reinforcement learning (MARL) is an emerging area of research. However, it lacks two important elements: a coherent view on MARL, and a well-defined problem objective. ...
Rinat Khoussainov
IJRR
2010
115views more  IJRR 2010»
14 years 6 months ago
Improving the Efficiency of Clearing with Multi-agent Teams
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
Geoffrey Hollinger, Sanjiv Singh, Athanasios Kehag...
BIRTHDAY
2003
Springer
15 years 1 months ago
On the Difference Problem for Semilinear Power Series
We prove in this paper that if r and s are two semilinear power series in commuting variables and s has bounded coefficients, then r-s is a rational series. This result can be tho...
Ion Petre