2233 search results - page 178 / 447 » On the Complexity of Theory Curbing |
174
click to vote
ISSAC
2004
Springer
15 years 12 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...
183
click to vote
RSCTC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper, we discuss approximation spaces in a granular computing framework. Such approximation spaces generalise the approaches to concept approximation existing in...
200
click to vote
IAT
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper defines an approach to simulation of natural systems, inspired by complex systems theory. A complex natural system is modeled as a multi-agent simulation system, agents...
172
click to vote
LATA
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Kanazawa ([1]) has studied the learnability of several parameterized families of classes of categorial grammars. These classes were shown to be learnable from text, in th...
151
click to vote
PPSN
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Three theoretical perspectives upon conservation of performance in function optimization are outlined. In terms of statistical information, performance is conserved when ...