8196 search results - page 291 / 1640 » Computational Modeling and Complexity Science |
179
click to vote
SMA
2005
ACM
16 years 5 days ago
2005
ACM
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
215
click to vote
PODS
1994
ACM
15 years 10 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
200
click to vote
JCSS
2008
15 years 6 months ago
2008
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
168
click to vote
FPL
2009
Springer
15 years 4 months ago
2009
Springer
In this article, we introduce the ongoing research in modeling and mapping for heterogeneous, customizable, parallel systems, as part of the effort in the newly established Center...
173
click to vote
HICSS
2007
IEEE
16 years 29 days ago
2007
IEEE
Abstract— The electricity price duration curve (EPDC) represents the probability distribution function of the electricity price considered as a random variable. The price uncerta...