Sciweavers

1431 search results - page 22 / 287
» The complexity of random ordered structures
Sort
View
COCOON
2008
Springer
14 years 11 months ago
The Computational Complexity of Link Building
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
Martin Olsen
CCA
2009
Springer
15 years 4 months ago
Separations of Non-monotonic Randomness Notions
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
Laurent Bienvenu, Rupert Hölzl, Thorsten Kr&a...
ICASSP
2011
IEEE
14 years 1 months ago
Stochastic optimization based on the Laplace transform order with applications to precoder designs
Stochastic optimization arising from precoding in a multi-antenna fading channel with channel mean feedback to maximize data rates is important but challenging. The use of relayin...
Minhua Ding, Keith Q. T. Zhang
RSA
2006
104views more  RSA 2006»
14 years 9 months ago
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
Alan M. Frieze, Michael Molloy
CEC
2005
IEEE
15 years 3 months ago
Music evolution in a complex system of interacting agents
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 ...
Tao Gong, Qian Zhang, Hua Wu