Sciweavers

1171 search results - page 39 / 235
» Multisource Algorithmic Information Theory
Sort
View
SODA
2010
ACM
151views Algorithms» more  SODA 2010»
14 years 7 months ago
A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...
S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari
SIGECOM
2008
ACM
103views ECommerce» more  SIGECOM 2008»
13 years 9 months ago
Mechanism design over discrete domains
Often, we wish to design incentive-compatible algorithms for settings in which the players' private information is drawn from discrete domains (e.g., integer values). Our mai...
Ahuva Mu'alem, Michael Schapira
CORR
2008
Springer
115views Education» more  CORR 2008»
13 years 9 months ago
Kolmogorov complexity in perspective
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rand...
Marie Ferbus-Zanda, Serge Grigorieff
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
14 years 1 months ago
A method for parameter calibration and relevance estimation in evolutionary algorithms
We present and evaluate a method for estimating the relevance and calibrating the values of parameters of an evolutionary algorithm. The method provides an information theoretic m...
Volker Nannen, A. E. Eiben
CISS
2008
IEEE
14 years 4 months ago
Distributed algorithm and reversible network
Motivated to design a feasible optical network architecture for the future Internet, we address the question of scheduling (wavelength assignment) in an optical network. The key ch...
Shreevatsa Rajagopalan, Devavrat Shah