2738 search results - page 112 / 548 » The Frobenius Problem and Its Generalizations |
IAT
2009
IEEE
15 years 1 months ago
2009
IEEE
Variants of the decentralized MDP model focus on problems exhibiting some special structure that makes them easier to solve in practice. Our work is concerned with two main issues...
JMLR
2006
14 years 10 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
AAAI
1994
14 years 11 months ago
1994
This article shows how rational analysis can be used to minimize learning cost for a general class of statistical learning problems. We discuss the factors that influence learning...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—This paper studies the problem of allocating network capacity through periodic auctions. Motivated primarily by a service overlay architecture, we impose the following condition...
COMPGEOM
2009
ACM
15 years 2 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....