911 search results - page 43 / 183 » Kolmogorov Complexity Cores |
151
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
134
click to vote
ENTCS
2002
15 years 6 months ago
2002
Solovay showed that there are noncomputable reals such that H( n) H(1n) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the conn...
164
click to vote
IJCBDD
2010
15 years 4 months ago
2010
: The explosion of highthroughput interaction data from proteomics studies gives us the opportunity to integrate Protein-Protein Interactions (PPI) from different type of interacti...
148
click to vote
AI
2004
Springer
15 years 6 months ago
2004
Springer
We study coalitional games in which agents are each assumed to have a goal to be achieved, and where the characteristic property of a coalition is a set of choices, with each choi...
171
click to vote
ADC
2006
Springer
15 years 10 months ago
2006
Springer
The quality of database distribution design, which involves fragmentation and allocation, should be assessed by the performance of a system. In particular, this applies to non-rel...