Sciweavers

1923 search results - page 272 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
IPPS
2007
IEEE
15 years 4 months ago
POET: Parameterized Optimizations for Empirical Tuning
The excessive complexity of both machine architectures and applications have made it difficult for compilers to statically model and predict application behavior. This observatio...
Qing Yi, Keith Seymour, Haihang You, Richard W. Vu...
STACS
1999
Springer
15 years 2 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
CG
2008
Springer
14 years 10 months ago
Fast, parallel, and asynchronous construction of BVHs for ray tracing animated scenes
Recent developments have produced several techniques for interactive ray tracing of dynamic scenes. In particular, bounding volume hierarchies (BVHs) are efficient acceleration st...
Ingo Wald, Thiago Ize, Steven G. Parker
PPSN
2000
Springer
15 years 1 months ago
Optimizing through Co-evolutionary Avalanches
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...
Stefan Boettcher, Allon G. Percus, Michelangelo Gr...
CAD
2005
Springer
14 years 9 months ago
Bayesian computer-aided experimental design of heterogeneous scaffolds for tissue engineering
This paper presents a Bayesian methodology for computer-aided experimental design of heterogeneous scaffolds for tissue engineering applications. These heterogeneous scaffolds hav...
Lee E. Weiss, Cristina H. Amon, Susan Finger, Eric...