Sciweavers

2523 search results - page 447 / 505
» Objective: In Minimum Context
Sort
View
PKDD
2010
Springer
122views Data Mining» more  PKDD 2010»
14 years 8 months ago
Exploration in Relational Worlds
Abstract. One of the key problems in model-based reinforcement learning is balancing exploration and exploitation. Another is learning and acting in large relational domains, in wh...
Tobias Lang, Marc Toussaint, Kristian Kersting
SAMOS
2010
Springer
14 years 8 months ago
A Polymorphic Register File for matrix operations
—Previous vector architectures divided the available register file space in a fixed number of registers of equal sizes and shapes. We propose a register file organization whic...
Catalin Bogdan Ciobanu, Georgi Kuzmanov, Georgi Ga...
TCS
2010
14 years 8 months ago
Maximum likelihood analysis of algorithms and data structures
We present a new approach for an average-case analysis of algorithms and data structures that supports a non-uniform distribution of the inputs and is based on the maximum likelih...
Ulrich Laube, Markus E. Nebel
TON
2010
158views more  TON 2010»
14 years 8 months ago
Always acyclic distributed path computation
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
Saikat Ray, Roch Guérin, Kin Wah Kwong, Rut...
WCRE
2010
IEEE
14 years 8 months ago
Immediacy through Interactivity: Online Analysis of Run-time Behavior
—Visualizations of actual run-time data support the comprehension of programs, like examples support the ion of abstract concepts and principles. Unfortunately, the required run-...
Michael Perscheid, Bastian Steinert, Robert Hirsch...