4940 search results - page 239 / 988 » On the Complexity of Universal Programs |
184
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string. The Kolmogorov structure function divides the s...
220
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Active learning strategies can be useful when manual labeling
effort is scarce, as they select the most informative
examples to be annotated first. However, for visual category
...
187
click to vote
COMPUTER
2002
15 years 6 months ago
2002
of abstraction and coarse granularity and distributed communication control. Focusing on using probabilistic metrics such as average values or variance to quantify design objective...
193
click to vote
ICIC
2009
Springer
16 years 1 months ago
2009
Springer
Genetic Programming(GP) can obtain a program structure to solve complex problem. This paper presents a new form of Genetic Programming, Function Sequence Genetic Programming (FSGP)...
167
click to vote
ACE
2004
15 years 8 months ago
2004
The issues surrounding curriculum design of many Computer Science and Software Engineering degree programs1 are many and complex. In particular, the question of whether prior prog...