350 search results - page 36 / 70 » Branching Programs for Tree Evaluation |
139
click to vote
CEC
2008
IEEE
15 years 10 months ago
2008
IEEE
—Genetic programming (GP), is a very general and efficient technique, often capable of outperforming more specialized techniques on a variety of tasks. In this paper, we suggest ...
132
Voted
DIMVA
2006
15 years 5 months ago
2006
Abstract. The Internet, and in particular the world-wide web, have become part of the everyday life of millions of people. With the growth of the web, the demand for on-line servic...
139
Voted
JAIR
2011
14 years 10 months ago
2011
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
125
Voted
AUSAI
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...
145
Voted
PPOPP
2012
ACM
13 years 11 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...