15033 search results - page 131 / 3007 » Complexity Theory and Algorithms |
136
click to vote
CORR
2000
Springer
15 years 3 months ago
2000
Springer
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...
132
click to vote
TNN
2008
15 years 3 months ago
2008
In this paper, we introduce a novel way of performing real-valued optimization in the complex domain. This framework enables a direct complex optimization technique when the cost f...
108
click to vote
AAAI
2000
15 years 5 months ago
2000
We introduce new linear time algorithms for satisfiability of binary propositional theories (2-SAT), and for recognition and satisfiability of renamable Horn theories. The algorit...
130
click to vote
LATIN
2000
Springer
15 years 7 months ago
2000
Springer
In this paper, we consider the open problem of the complexity of the LLL algorithm in the case when the approximation parameter of the algorithm has its extreme value
154
click to vote
SOFSEM
2000
Springer
15 years 7 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...