2233 search results - page 211 / 447 » On the Complexity of Theory Curbing |
158
click to vote
COCO
1994
Springer
15 years 10 months ago
1994
Springer
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
179
click to vote
IPMU
1992
Springer
15 years 10 months ago
1992
Springer
This paper deals with the problem of inference under uncertain information. This is a generalization of a paper of Cardona et al. (1991a) where rules were not allowed to contain n...
149
click to vote
ACOM
2004
Springer
15 years 10 months ago
2004
Springer
The Cognitive Agent Specification Language (CASL) is a framework for specifying and verifying complex communicating multiagent systems. In this paper, we develop an extended versi...
182
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
144
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Learning goal-scoring behaviour from scratch for simulated robot soccer is considered to be a very difficult problem, and is often achieved by endowing players with an innate set ...