1029 search results - page 123 / 206 » Local Minima Embedding |
124
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
104
click to vote
LCTRTS
2004
Springer
15 years 8 months ago
2004
Springer
Most modern compilers operate by applying a fixed, program-independent sequence of optimizations to all programs. Compiler writers choose a single “compilation sequence”, or ...
138
click to vote
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
114
click to vote
MM
2000
ACM
15 years 7 months ago
2000
ACM
In this paper we present novel algorithms for computing scenes and within-scene structures in films. We begin by mapping insights from film-making rules and experimental results f...
149
click to vote
SIGGRAPH
1992
ACM
15 years 7 months ago
1992
ACM
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...