146 search results - page 23 / 30 » Generating a novel sort algorithm using Reinforcement Progra... |
POPL
2006
ACM
14 years 9 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
SIGMOD
2009
ACM
14 years 3 months ago
2009
ACM
The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming (DP) to find the optimal query execution plan (QEP) without evalua...
ECCV
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. Movies and TV are a rich source of diverse and complex video of people, objects, actions and locales "in the wild". Harvesting automatically labeled sequences o...
ICSE
2008
IEEE-ACM
14 years 8 months ago
2008
IEEE-ACM
Software Testing can take up to half of the resources of the development of new software. Although there has been a lot of work on automating the testing phase, fixing a bug after...
TCAD
2008
13 years 8 months ago
2008
Embedded systems are constrained by the available memory. Code-compression techniques address this issue by reducing the code size of application programs. It is a major challenge ...