29046 search results - page 361 / 5810 » Computable Models |
132
click to vote
JAIR
2008
15 years 4 months ago
2008
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...
131
click to vote
CGF
2005
15 years 4 months ago
2005
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...
119
click to vote
TSMC
2008
15 years 4 months ago
2008
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...
163
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
—We consider timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints...
144
click to vote
CRYPTO
2005
Springer
15 years 10 months ago
2005
Springer
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs. Such a computation must preserve certain security propertie...