1662 search results - page 81 / 333 » The Computational Complexity of Agent Design Problems |
VL
2006
IEEE
14 years 2 months ago
2006
IEEE
Now that we have end-user programming environments capable of empowering kids with no programming background to build games in a matter of hours, a new quest for raising the ceili...
ISCI
2002
2002
Intelligent learning and control of autonomous robotic agents operating in unstructured environments
13 years 8 months ago
The control of autonomous intelligent robotic agent operating in unstructured changing environments includes many objective difficulties. One major difficulty concerns the charact...
AAAI
2010
13 years 10 months ago
2010
We consider here the problem of building a never-ending language learner; that is, an intelligent computer agent that runs forever and that each day must (1) extract, or read, inf...
ESCIENCE
2006
IEEE
14 years 16 days ago
2006
IEEE
In this paper we present a general domain for the analysis of workflows and workflow components based on the notion of a collection of Turing machines sharing a set of tapes. We s...
FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a wide variety of r...