117 search results - page 14 / 24 » Run-Time Bytecode Specialization |
PPPJ
2009
ACM
14 years 4 months ago
2009
ACM
Dynamic compilers can optimize application code specifically for observed code behavior. Such behavior does not have to be stable across the entire program execution to be bene...
DLS
2010
13 years 7 months ago
2010
Dynamic languages such as Python allow programs to be written more easily using high-level constructs such as comprehensions for queries and using generic code. Efficient executio...
ICML
2004
IEEE
14 years 10 months ago
2004
IEEE
Hill-climbing search is the most commonly used search algorithm in ILP systems because it permits the generation of theories in short running times. However, a well known drawback...
WWW
2001
ACM
14 years 10 months ago
2001
ACM
We introduce a method for learning query transformations that improves the ability to retrieve answers to questions from an information retrieval system. During the training stage...
STOC
2006
ACM
14 years 10 months ago
2006
ACM
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...