3179 search results - page 115 / 636 » Applications of PCF Theory |
ACMSE
2006
ACM
14 years 4 months ago
2006
ACM
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
SPAA
2005
ACM
14 years 3 months ago
2005
ACM
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
ICAISC
2004
Springer
14 years 3 months ago
2004
Springer
This paper presents a novel approach to financial time series analysis and prediction. It is mainly devoted to the problem of forecasting university facility and administrative co...
ISSAC
2004
Springer
14 years 3 months ago
2004
Springer
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...
ICTAI
2000
IEEE
14 years 2 months ago
2000
IEEE
This paper presents a problem-independent framework that uni es various mechanisms for solving discrete constrained nonlinear programming (NLP) problems whose functions are not ne...