Sciweavers

5263 search results - page 89 / 1053
» Open Constraint Optimization
Sort
View
112
Voted
AAAI
2008
15 years 5 months ago
Efficient Memoization for Dynamic Programming with Ad-Hoc Constraints
We address the problem of effective reuse of subproblem solutions in dynamic programming. In dynamic programming, a memoed solution of a subproblem can be reused for another if th...
Joxan Jaffar, Andrew E. Santosa, Razvan Voicu
146
Voted
CEC
2009
IEEE
15 years 10 months ago
On-line neuroevolution applied to The Open Racing Car Simulator
— The application of on-line learning techniques to modern computer games is a promising research direction. In fact, they can be used to improve the game experience and to achie...
Luigi Cardamone, Daniele Loiacono, Pier Luca Lanzi
124
Voted
CP
2009
Springer
15 years 1 months ago
Minimizing the Maximum Number of Open Stacks by Customer Search
We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer s...
Geoffrey Chu, Peter J. Stuckey
138
Voted
IJPP
2010
156views more  IJPP 2010»
15 years 22 days ago
ForestGOMP: An Efficient OpenMP Environment for NUMA Architectures
Exploiting the full computational power of current hierarchical multiprocessor machines requires a very careful distribution of threads and data among the underlying non-uniform ar...
François Broquedis, Nathalie Furmento, Bric...
ICSE
2009
IEEE-ACM
15 years 10 months ago
Semantics-based code search
Our goal is to use the vast repositories of available open source code to generate specific functions or classes that meet a user’s specifications. The key words here are spec...
Steven P. Reiss