47 search results - page 2 / 10 » Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Co... |
FOCM
2010
13 years 2 months ago
2010
In [BP08], the average complexity of linear homotopy methods to solve polynomial equations with random initial input (in a sense to be described below) was proven to be finite, an...
CEC
2005
IEEE
13 years 11 months ago
2005
IEEE
The evolution of music, from random note strings to certain “pleasant” note sequences, is traced in a multi-agent computational model. A community of agents, with some musical ...
TAMC
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
IJCAI
1989
13 years 6 months ago
1989
This paper deals with a well known problem in AI planning: detecting and resolving conflicts in nonlinear plans. We sketch a theory of restricted conflict detection and resolution...
TCS
1998
13 years 5 months ago
1998
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...