1420 search results - page 108 / 284 » Multi-point Constructive Search |
117
click to vote
ICML
2002
IEEE
16 years 5 months ago
2002
IEEE
An open problem in reinforcement learning is discovering hierarchical structure. HEXQ, an algorithm which automatically attempts to decompose and solve a model-free factored MDP h...
CIKM
2004
Springer
15 years 9 months ago
2004
Springer
Under construction… Categories and Subject Descriptors H.3.3 [Information Storage and Retrieval]: Information Search and Retrieval – clustering. General Terms Algorithms, Expe...
114
click to vote
HCI
2007
15 years 5 months ago
2007
The current research sought to construct a computational model of human navigation for virtual three dimensional environments. The model was implemented within the ACT-R cognitive ...
141
click to vote
ARSCOM
2004
15 years 4 months ago
2004
All cubic partial cubes (i.e., cubic isometric subgraphs of hypercubes) up to 30 vertices and all edge-critical partial cubes up to 14 vertices are presented. The lists of graphs ...
171
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...