19320 search results - page 102 / 3864 » On the complexity of computing determinants |
126
click to vote
IJCAI
2001
15 years 5 months ago
2001
In the last decade, there has been several studies on the computational complexity of planning. These studies normally assume that the goal of planning is to make a certain fluent...
123
click to vote
CATS
2007
15 years 6 months ago
2007
A model for the problem of predicting the outputs of a process, based only on knowledge of previous outputs, is proposed in terms of a decision problem. The strength of this parti...
138
click to vote
MP
2006
15 years 4 months ago
2006
Stochastic programming is the subfield of mathematical programming that considers optimization in the presence of uncertainty. During the last four decades a vast amount of litera...
220
click to vote
IANDC
2008
15 years 4 months ago
2008
Abstract. Cellular Automata can be considered discrete dynamical systems and at the same time a model of parallel computation. In this paper we investigate the connections between ...
141
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...