6251 search results - page 1079 / 1251 » Randomness, Computability, and Density |
153
Voted
COCO
1998
Springer
15 years 8 months ago
1998
Springer
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
125
click to vote
CP
1997
Springer
15 years 8 months ago
1997
Springer
Abstract. Combinatorial search methods often exhibit a large variability in performance. We study the cost pro les of combinatorial search procedures. Our study reveals some intrig...
122
click to vote
SMA
1993
ACM
15 years 8 months ago
1993
ACM
: Parametric design is an important modeling paradigm in computer aided design. Relationships (constraints) between the degrees of freedom (DOFs) of the model, instead of the DOFs ...
154
click to vote
ACAL
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We explore a new definition of creativity -- one which emphasizes the statistical capacity of a system to generate previously unseen patterns -- and discuss motivations f...
128
click to vote
CISSE
2007
Springer
15 years 8 months ago
2007
Springer
Abstract- This paper explores valuing long-term equity forwardcontracts or futures where both the underlying volatility and the interest rates are modeled as stochastic random vari...