Sciweavers

350 search results - page 54 / 70
» Branching Programs for Tree Evaluation
Sort
View
ASPLOS
2008
ACM
13 years 9 months ago
Improving the performance of object-oriented languages with dynamic predication of indirect jumps
Indirect jump instructions are used to implement increasinglycommon programming constructs such as virtual function calls, switch-case statements, jump tables, and interface calls...
José A. Joao, Onur Mutlu, Hyesoon Kim, Rish...
PPPJ
2009
ACM
14 years 2 months ago
Tracking performance across software revisions
Repository-based revision control systems such as CVS, RCS, Subversion, and GIT, are extremely useful tools that enable software developers to concurrently modify source code, man...
Nagy Mostafa, Chandra Krintz
AI
2006
Springer
13 years 7 months ago
Is real-valued minimax pathological?
Deeper searches in game-playing programs relying on the minimax principle generally produce better results. Theoretical analyses, however, suggest that in many cases minimaxing am...
Mitja Lustrek, Matjaz Gams, Ivan Bratko
DEXA
1999
Springer
87views Database» more  DEXA 1999»
13 years 12 months ago
SECONDO/QP: Implementation of a Generic Query Processor
: In an extensible database system, evaluation of a query plan is done in cooperation between a collection of operator implementation functions and a component of the DBMS that we ...
Ralf Hartmut Güting, Stefan Dieker, Claudia F...
ECAI
2004
Springer
14 years 1 months ago
Learning Techniques for Automatic Algorithm Portfolio Selection
The purpose of this paper is to show that a well known machine learning technique based on Decision Trees can be effectively used to select the best approach (in terms of efficien...
Alessio Guerri, Michela Milano