636 search results - page 100 / 128 » Measuring Complexity of Intelligent Machines |
121
click to vote
DMIN
2008
15 years 2 months ago
2008
The knowledge discovery process encounters the difficulties to analyze large amount of data. Indeed, some theoretical problems related to high dimensional spaces then appear and de...
104
Voted
LATA
2009
Springer
15 years 7 months ago
2009
Springer
We show that fixed membership testing for many interesting subclasses of multi-pushdown machines is no harder than for pushdowns with single stack. The models we consider are MVPA...
119
Voted
TPHOL
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract. We present a comprehensive set of tactics that make it practical to use separation logic in a proof assistant. These tactics enable the verification of partial correctne...
109
Voted
EUROGP
2009
Springer
15 years 7 months ago
2009
Springer
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in GP from the perspec...
102
Voted
CP
2004
Springer
15 years 6 months ago
2004
Springer
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...