8298 search results - page 85 / 1660 » On the Complexity of Numerical Analysis |
180
click to vote
AAAI
1996
15 years 7 months ago
1996
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
166
click to vote
ICANN
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The growth in amount of data available today has encouraged the development of effective data analysis methods to support human decision-making. Neuro-fuzzy computation ...
151
click to vote
COR
2008
15 years 6 months ago
2008
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
167
click to vote
AAAI
1993
15 years 7 months ago
1993
This paper analyzes the complexity of on-line reinforcement learning algorithms, namely asynchronous realtime versions of Q-learning and value-iteration, applied to the problem of...
153
click to vote
TCOM
2008
15 years 6 months ago
2008
This letter presents a new method to directly analyze and optimize symbol error rate (SER) performance of minimum decoding complexity (MDC) ABBA space-time block codes based on a t...