1236 search results - page 161 / 248 » Prefix-Like Complexities and Computability in the Limit |
EUROGRAPHICS
2010
Eurographics
15 years 6 months ago
2010
Eurographics
When simulating fluids, tetrahedral methods provide flexibility and ease of adaptivity that Cartesian grids find difficult to match. However, this approach has so far been lim...
108
click to vote
CGA
1999
14 years 9 months ago
1999
emsintovirtualenvironments,whileabstracting the modeling process as much as possible. To achieve efficiency,weconcentrateoncullingdynamicalsystems: if the system is not in view, we...
HPCA
2011
IEEE
14 years 1 months ago
2011
IEEE
As the web becomes the platform of choice for execution of more complex applications, a growing portion of computation is handed off by developers to the client side to reduce net...
100
click to vote
CGF
2011
14 years 1 months ago
2011
Recently, the problem of intrinsic shape matching has received a lot of attention. A number of algorithms have been proposed, among which random-sampling-based techniques have bee...
102
click to vote
PPSN
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...