Sciweavers

5864 search results - page 1118 / 1173
» Can We Work around Numerical Methods
Sort
View
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
15 years 8 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
GECCO
2010
Springer
248views Optimization» more  GECCO 2010»
15 years 8 months ago
Integrating decision space diversity into hypervolume-based multiobjective search
Multiobjective optimization in general aims at learning about the problem at hand. Usually the focus lies on objective space properties such as the front shape and the distributio...
Tamara Ulrich, Johannes Bader, Eckart Zitzler
ATAL
2008
Springer
15 years 7 months ago
Suspending and resuming tasks in BDI agents
Intelligent agents designed to work in complex, dynamic environments must respond robustly and flexibly to environmental and circumstantial changes. An agent must be capable of de...
John Thangarajah, James Harland, David N. Morley, ...
CASES
2008
ACM
15 years 7 months ago
Cache-aware cross-profiling for java processors
Performance evaluation of embedded software is essential in an early development phase so as to ensure that the software will run on the embedded device's limited computing r...
Walter Binder, Alex Villazón, Martin Schoeb...
221
Voted
NIPS
2008
15 years 6 months ago
Optimization on a Budget: A Reinforcement Learning Approach
Many popular optimization algorithms, like the Levenberg-Marquardt algorithm (LMA), use heuristic-based "controllers" that modulate the behavior of the optimizer during ...
Paul Ruvolo, Ian R. Fasel, Javier R. Movellan
« Prev « First page 1118 / 1173 Last » Next »