6598 search results - page 357 / 1320 » Graph Theory with Applications |
140
click to vote
ACMSE
2006
ACM
16 years 21 days 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...
145
click to vote
ICAISC
2004
Springer
16 years 2 days 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...
178
click to vote
ISSAC
2004
Springer
16 years 2 days 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...
169
click to vote
ICTAI
2000
IEEE
15 years 11 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...
162
click to vote
IJCNN
2000
IEEE
15 years 11 months ago
2000
IEEE
The well-known backpropagation (BP) derivative computation process for multilayer perceptrons (MLP) learning can be viewed as a simplified version of the Kelley-Bryson gradient f...