Sciweavers

6943 search results - page 871 / 1389
» Representations for evolutionary algorithms
Sort
View
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
15 years 11 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
VRST
1997
ACM
15 years 11 months ago
View volume culling using a probabilistic caching scheme
This paper describes a new algorithm for view volume culling. During an interactive walkthrough of a 3D scene, at any moment a large proportion of objects will be outside of the v...
Mel Slater, Yiorgos Chrysanthou
SIGGRAPH
1994
ACM
15 years 11 months ago
Textures and radiosity: controlling emission and reflection with texture maps
In this paper we discuss the efficient and accurate incorporation of texture maps into a hierarchical Galerkin radiosity algorithm. This extension of the standard algorithm allows...
Reid Gershbein, Peter Schröder, Pat Hanrahan
EVOW
2010
Springer
15 years 11 months ago
Ant Colony Optimization for Tree Decompositions
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
Thomas Hammerl, Nysret Musliu
CPAIOR
2006
Springer
15 years 10 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter