Sciweavers

1330 search results - page 201 / 266
» No Classic Boundary Conditions
Sort
View
SIGGRAPH
1999
ACM
15 years 10 months ago
Computing Exact Shadow Irradiance Using Splines
We present a solution to the general problem of characterizing shadows in scenes involving a uniform polygonal area emitter and a polygonal occluder in arbitrary position by manif...
Michael M. Stark, Elaine Cohen, Tom Lyche, Richard...
AFRIGRAPH
2009
ACM
15 years 10 months ago
Using an implicit min/max KD-tree for doing efficient terrain line of sight calculations
The generation of accurate Line of Sight (LOS) visibility information consumes significant resources in large scale synthetic environments such as many-on-many serious games and b...
Bernardt Duvenhage
CNSR
2004
IEEE
131views Communications» more  CNSR 2004»
15 years 10 months ago
Fast Flow Classification over Internet
In order to control and manage highly aggregated Internet traffic flows efficiently, we need to be able to categorize flows into distinct classes and to be knowledgeable about the...
A. Oveissian, Kavé Salamatian, Augustin Sou...
AAAI
2006
15 years 7 months ago
Model Counting: A New Strategy for Obtaining Good Bounds
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
Carla P. Gomes, Ashish Sabharwal, Bart Selman
WSC
2000
15 years 7 months ago
Using simulation and critical points to define states in continuous search spaces
Many artificial intelligence techniques rely on the notion ate" as an abstraction of the actual state of the nd an "operator" as an abstraction of the actions that ...
Marc S. Atkin, Paul R. Cohen