4372 search results - page 290 / 875 » Algorithmic Theories of Everything |
164
click to vote
IPCO
2007
15 years 7 months ago
2007
According to the present state of the theory of the matroid matching problem, the existence of a good characterization to the size of a maximum matching depends on the behavior of ...
139
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rand...
149
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We describe a new construction of an incoherent dictionary, referred to as the oscillator dictionary, which is based on considerations in the representation theory of finite groups...
131
click to vote
DM
2008
15 years 6 months ago
2008
The core of a game v on N, which is the set of additive games dominating v such that (N) = v(N), is a central notion in cooperative game theory, decision making and in combinator...
170
click to vote
JSAC
2006
15 years 6 months ago
2006
A systematic understanding of the decomposability structures in network utility maximization is key to both resource allocation and functionality allocation. It helps us obtain the...