Sciweavers

219 search results - page 19 / 44
» Optimal dyadic decision trees
Sort
View
HEURISTICS
2008
92views more  HEURISTICS 2008»
13 years 10 months ago
Learning heuristics for basic block instruction scheduling
Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction scheduling is to ...
Abid M. Malik, Tyrel Russell, Michael Chase, Peter...
CIMCA
2008
IEEE
14 years 4 months ago
Tree Exploration for Bayesian RL Exploration
Research in reinforcement learning has produced algorithms for optimal decision making under uncertainty that fall within two main types. The first employs a Bayesian framework, ...
Christos Dimitrakakis
ATVA
2007
Springer
136views Hardware» more  ATVA 2007»
14 years 4 months ago
Symbolic Fault Tree Analysis for Reactive Systems
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, wh...
Marco Bozzano, Alessandro Cimatti, Francesco Tappa...
IGARSS
2010
13 years 7 months ago
New hyperspectral data representation using binary partition tree
The optimal exploitation of the information provided by hyperspectral images requires the development of advanced image processing tools. This paper introduces a new hierarchical ...
Silvia Valero, Philippe Salembier, Jocelyn Chanuss...
SIGIR
2011
ACM
13 years 1 months ago
Functional matrix factorizations for cold-start recommendation
A key challenge in recommender system research is how to effectively profile new users, a problem generally known as cold-start recommendation. Recently the idea of progressivel...
Ke Zhou, Shuang-Hong Yang, Hongyuan Zha