Sciweavers

14190 search results - page 271 / 2838
» computer 2008
Sort
View
165
Voted
JAIR
2008
123views more  JAIR 2008»
15 years 6 months ago
The Computational Complexity of Dominance and Consistency in CP-Nets
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
Judy Goldsmith, Jérôme Lang, Miroslaw...
IPL
2007
78views more  IPL 2007»
15 years 6 months ago
Ensuring the quasi-termination of needed narrowing computations
We present a characterization of first-order functional programs which are quasiterminating w.r.t. the symbolic execution mechanism of needed narrowing, i.e., computations in the...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
TIT
2008
107views more  TIT 2008»
15 years 6 months ago
Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...
Igor Zinovik, Daniel Kroening, Yury Chebiryak
CGF
2005
147views more  CGF 2005»
15 years 6 months ago
GPU Simulation and Rendering of Volumetric Effects for Computer Games and Virtual Environments
As simulation and rendering capabilities continue to increase, volumetric effects like smoke, fire or explosions will be frequently encountered in computer games and virtual envir...
Jens Krüger, Rüdiger Westermann
TSMC
2008
113views more  TSMC 2008»
15 years 6 months ago
Computational Methods for Verification of Stochastic Hybrid Systems
Stochastic hybrid system (SHS) models can be used to analyze and design complex embedded systems that operate in the presence of uncertainty and variability. Verification of reacha...
Xenofon D. Koutsoukos, Derek Riley