1429 search results - page 34 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
PARA
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. This paper presents a method of solving initial value problems using Euler’s method, based on the domain of interval valued functions of a real variable. In contrast to...
APPML
2007
13 years 7 months ago
2007
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
LATIN
2000
Springer
13 years 11 months ago
2000
Springer
In this paper, we consider the open problem of the complexity of the LLL algorithm in the case when the approximation parameter of the algorithm has its extreme value
SIAMCOMP
2010
13 years 6 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...