Sciweavers

606 search results - page 43 / 122
» Least-Commitment Action Selection
Sort
View
JAIR
2011
134views more  JAIR 2011»
13 years 3 months ago
Scaling up Heuristic Planning with Relational Decision Trees
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
Tomás de la Rosa, Sergio Jiménez, Ra...
SIGSOFT
2010
ACM
13 years 6 months ago
Speculative analysis: exploring future development states of software
Most software tools and environments help developers analyze the present and past development states of their software systems. Few approaches have investigated the potential cons...
Yuriy Brun, Reid Holmes, Michael D. Ernst, David N...
ICASSP
2009
IEEE
13 years 5 months ago
Tree configuration games for distributed stream mining systems
We consider the problem of configuring classifier trees in distributed stream mining system. The configuration involves selecting appropriate false-alarm detection tradeoffs for e...
Hyunggon Park, Deepak S. Turaga, Olivier Verscheur...
CHI
2007
ACM
14 years 8 months ago
Pressure marks
Selections and actions in GUI's are often separated ? i.e. an action or command typically follows a selection. This sequence imposes a lower bound on the interaction time tha...
Gonzalo A. Ramos, Ravin Balakrishnan
AAAI
2004
13 years 9 months ago
Learning and Applying Competitive Strategies
Learning reusable sequences can support the development of expertise in many domains, either by improving decisionmaking quality or decreasing execution speed. This paper introduc...
Esther Lock, Susan L. Epstein