Sciweavers

2588 search results - page 23 / 518
» Applications of Kolmogorov complexity to computable model th...
Sort
View
CORR
2002
Springer
111views Education» more  CORR 2002»
14 years 11 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
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...
Marcus Hutter
CG
2004
Springer
14 years 11 months ago
A stratification approach for modeling two-dimensional cell complexes
This work presents a stratification approach for modeling two-dimensional cell complexes. It introduces the concept of combinatorial stratification and uses the Handlebody theory ...
Sinésio Pesco, Geovan Tavares, Hélio...
GCC
2003
Springer
15 years 4 months ago
Computing Pool: A Simplified and Practical Computational Grid Model
Even though grid research is prosperous in an extensive context, few grid platforms for high performance computing are practical and in operation so far. Since most applications a...
Peng Liu, Yao Shi, Sanli Li
CIE
2006
Springer
15 years 2 months ago
Forcing with Random Variables and Proof Complexity
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
Jan Krajícek
DEXAW
2004
IEEE
111views Database» more  DEXAW 2004»
15 years 2 months ago
A Complex Systems Approach to Service Discovery
Complex systems are those systems composed of many, often very simple, interacting autonomous entities. Interactions between these entities give rise to behaviour and patterns at t...
Ricky Robinson, Jadwiga Indulska