1139 search results - page 27 / 228 » Bounded Ideation Theory |
CAD
2007
Springer
13 years 9 months ago
2007
Springer
Defeaturing is a popular CAD/ CAE simplification technique where ‘small or irrelevant features’ are suppressed within a CAD model for speeding-up downstream processes, especia...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Abstract. Notoriously, quantum computation shatters complexity theory, but is innocuous to computability theory [17]. Yet several works have shown how quantum theory as it stands c...
PODC
2009
ACM
14 years 9 months ago
2009
ACM
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
IJCAI
1993
13 years 10 months ago
1993
Since its inception, arti cial intelligence has relied upon a theoretical foundation centred around perfect rationality as the desired property of intelligent systems. We argue, a...
UMC
2000
14 years 14 days ago
2000
Abstract. We consider various extensions and modifications of Shannon's General Purpose Analog Computer, which is a model of computation by differential equations in continuou...