999 search results - page 130 / 200 » On the Decidability of Functional Uncertainty |
NA
2010
13 years 7 months ago
2010
It is well known that it is an ill-posed problem to decide whether a function has a multiple root. Even for a univariate polynomial an arbitrary small perturbation of a polynomial ...
CIE
2011
Springer
12 years 8 months ago
2011
Springer
Automatic classes are classes of languages for which a finite automaton can decide whether a given element is in a set given by its index. The present work studies the learnabilit...
COCO
2010
Springer
13 years 10 months ago
2010
Springer
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
ATAL
2007
Springer
14 years 3 months ago
2007
Springer
Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve...
RAS
2006
13 years 8 months ago
2006
In this paper, we present techniques that allow one or multiple mobile robots to efficiently explore and model their environment. While much existing research in the area of Simul...