2089 search results - page 71 / 418 » A New Problem in String Searching |
WEBI
2005
Springer
15 years 3 months ago
2005
Springer
The most well known search techniques are perhaps the PageRank and HITS algorithms. In this paper we argue that these algorithms miss an important dimension, the temporal dimensio...
APAL
2006
14 years 9 months ago
2006
Parameterized complexity has, so far, been largely con ned to consideration of computational problems as decision or search problems. However, it is becoming evident that the param...
AAAI
2008
15 years 3 days ago
2008
Checking CSP consistency is shown, in theory, to be an NP-complete problem. There is two families of methods for CSP consistency checking. The first family holds the complete meth...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents a new method — the Time-delay Added Evolutionary Forecasting (TAEF) method — for time series prediction which performs an evolutionary search of the minimu...
AUTOMATICA
2008
14 years 10 months ago
2008
In this paper, the identification of a class of nonlinear systems which admits input-output maps described by a finite degree Volterra series is considered. In actual fact, it app...