7522 search results - page 316 / 1505 » Spacing memetic algorithms |
166
click to vote
GRAPHITE
2004
ACM
16 years 6 days ago
2004
ACM
A novel algorithm is presented that overcomes limitations of existing shadow volume algorithms when dealing with nonmanifold geometry and space partitioning. This simple algorithm...
170
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
180
click to vote
STOC
1997
ACM
15 years 11 months ago
1997
ACM
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
201
click to vote
SIGGRAPH
1993
ACM
15 years 10 months ago
1993
ACM
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
189
click to vote
SIGGRAPH
1989
ACM
15 years 10 months ago
1989
ACM
A solid noise is a function that defines a random value at each point in space. Solid noises have immediate and powerful applications in surface texturing, stochastic modeling, a...