1376 search results - page 135 / 276 » The Localization Hypothesis and Machines |
ICML
2003
IEEE
16 years 1 months ago
2003
IEEE
The paper explores a very simple agent design method called Q-decomposition, wherein a complex agent is built from simpler subagents. Each subagent has its own reward function and...
103
Voted
MICRO
1996
IEEE
15 years 5 months ago
1996
IEEE
For decades, the serialization constraints imposed by true data dependences have been regarded as an absolute limit--the dataflow limit--on the parallel execution of serial progra...
117
click to vote
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
75
Voted
ALT
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. This work extends studies of Angluin, Lange and Zeugmann on the dependence of learning on the hypotheses space chosen for the class. In subsequent investigations, uniform...
128
click to vote
MLDM
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In supervised learning, discretization of the continuous explanatory attributes enhances the accuracy of decision tree induction algorithms and naive Bayes classifier. M...