Sciweavers

15 search results - page 1 / 3
» The hardness of the Expected Decision Depth problem
Sort
View
IPL
2007
52views more  IPL 2007»
13 years 4 months ago
The hardness of the Expected Decision Depth problem
Dana Ron, Amir Rosenfeld, Salil P. Vadhan
CVPR
2000
IEEE
13 years 9 months ago
Learning Patterns from Images by Combining Soft Decisions and Hard Decisions
We present a novel approach for learning patterns (sub-images) shared by multiple images without prior knowledge about the number and the positions of the patterns in the images. ...
Pengyu Hong, Thomas S. Huang, Roy Wang
AAAI
2006
13 years 6 months ago
Hard Constrained Semi-Markov Decision Processes
In multiple criteria Markov Decision Processes (MDP) where multiple costs are incurred at every decision point, current methods solve them by minimising the expected primary cost ...
Wai-Leong Yeow, Chen-Khong Tham, Wai-Choong Wong
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
13 years 4 months ago
On the Difficulty of Designing Good Classifiers
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...
AI
2004
Springer
13 years 10 months ago
Multi-attribute Decision Making in a Complex Multiagent Environment Using Reinforcement Learning with Selective Perception
Abstract. Choosing between multiple alternative tasks is a hard problem for agents evolving in an uncertain real-time multiagent environment. An example of such environment is the ...
Sébastien Paquet, Nicolas Bernier, Brahim C...