1420 search results - page 108 / 284 » Multi-point Constructive Search |
156
click to vote
ICML
2002
IEEE
16 years 7 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...
128
click to vote
CIKM
2004
Springer
16 years 3 days 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...
150
click to vote
HCI
2007
15 years 8 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 ...
179
click to vote
ARSCOM
2004
15 years 6 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 ...
220
click to vote
GECCO
2009
Springer
16 years 1 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. ...