Sciweavers

627 search results - page 66 / 126
» Kolmogorov-Loveland Randomness and Stochasticity
Sort
View
COLT
2007
Springer
14 years 1 months ago
Observational Learning in Random Networks
In the standard model of observational learning, n agents sequentially decide between two alternatives a or b, one of which is objectively superior. Their choice is based on a stoc...
Julian Lorenz, Martin Marciniszyn, Angelika Steger
FOCS
2003
IEEE
14 years 1 months ago
Switch Scheduling via Randomized Edge Coloring
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An ...
CP
2006
Springer
13 years 11 months ago
Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
Frank Hutter, Youssef Hamadi, Holger H. Hoos, Kevi...
ACL
2008
13 years 9 months ago
Efficient, Feature-based, Conditional Random Field Parsing
Discriminative feature-based methods are widely used in natural language processing, but sentence parsing is still dominated by generative methods. While prior feature-based dynam...
Jenny Rose Finkel, Alex Kleeman, Christopher D. Ma...
TCOM
2010
133views more  TCOM 2010»
13 years 6 months ago
Transmission control in cognitive radio as a Markovian dynamic game: Structural result on randomized threshold policies
Abstract——This paper considers an uplink time division multiple access (TDMA) cognitive radio network where multiple cognitive radios (secondary users) attempt to access a spect...
J. Huang, V. Krishnamurthy