2479 search results - page 220 / 496 » Quantum complexity theory |
191
click to vote
RSCTC
2004
Springer
16 years 2 days 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...
207
Voted
IAT
2003
IEEE
16 years 10 hour 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...
181
click to vote
LATA
2010
Springer
15 years 12 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...
157
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 ...
201
click to vote
FSTTCS
1991
Springer
15 years 10 months ago
1991
Springer
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...