2244 search results - page 38 / 449 » A new heuristic approach for non-convex optimization problem... |
131
click to vote
PPSN
2000
Springer
15 years 9 months ago
2000
Springer
Domain knowledge is essential for successful problem solving and optimization. This paper introduces a framework in which a form of automatic domain knowledge extraction can be im...
169
click to vote
LCPC
2005
Springer
15 years 11 months ago
2005
Springer
The goal of this work is a systematic approach to compiler optimization for simultaneously optimizing across multiple levels of the memory hierarchy. Our approach combines compiler...
162
click to vote
AI
2008
Springer
15 years 6 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
187
click to vote
AIPS
2006
15 years 7 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
137
click to vote
SCHEDULING
2010
15 years 25 days ago
2010
We consider large volume job shop scheduling problems, in which there is a fixed number of machines, a bounded number of activities per job, and a large number of jobs. In large v...