Sciweavers

CORR
2008
Springer
63views Education» more  CORR 2008»
14 years 17 days ago
Two Remarkable Computational Competencies of the Simple Genetic Algorithm
Since the inception of genetic algorithmics the identification of computational efficiencies of the simple genetic algorithm (SGA) has been an important goal. In this paper we dist...
Keki M. Burjorjee
CORR
2008
Springer
112views Education» more  CORR 2008»
14 years 17 days ago
The Fundamental Problem with the Building Block Hypothesis
Skepticism of the building block hypothesis has previously been expressed on account of the weak theoretical foundations of this hypothesis and anomalies in the empirical record o...
Keki M. Burjorjee
CORR
2008
Springer
52views Education» more  CORR 2008»
14 years 17 days ago
A static theory of promises
We discuss for the concept of promises within a framework that can be applied to either humans or technology. We compare promises to the more established notion of obligations and...
Jan A. Bergstra, Mark Burgess
CORR
2008
Springer
162views Education» more  CORR 2008»
14 years 17 days ago
Welfare Undominated Groves Mechanisms
A common objective in mechanism design is to choose the outcome (for example, allocation of resources) that maximizes the sum of the agents' valuations, without introducing in...
Krzysztof R. Apt, Vincent Conitzer, Mingyu Guo, Ev...
CORR
2008
Springer
114views Education» more  CORR 2008»
14 years 17 days ago
A Simple Linear Ranking Algorithm Using Query Dependent Intercept Variables
The LETOR website contains three information retrieval datasets used as a benchmark for testing machine learning ideas for ranking. Algorithms participating in the challenge are re...
Nir Ailon
CORR
2008
Springer
82views Education» more  CORR 2008»
14 years 17 days ago
On the Throughput Maximization in Dencentralized Wireless Networks
Jamshid Abouei, Alireza Bayesteh, Masoud Ebrahimi,...
CORR
2008
Springer
126views Education» more  CORR 2008»
14 years 17 days ago
Non-Negative Matrix Factorization, Convexity and Isometry
Traditional Non-Negative Matrix Factorization (NMF) [19] is a successful algorithm for decomposing datasets into basis function that have reasonable interpretation. One problem of...
Nikolaos Vasiloglou, Alexander G. Gray, David V. A...
CORR
2008
Springer
104views Education» more  CORR 2008»
14 years 17 days ago
Structural abstract interpretation, A formal study using Coq
al abstract interpretation A formal study using Coq Yves Bertot INRIA Sophia-M
Yves Bertot
CORR
2008
Springer
133views Education» more  CORR 2008»
14 years 17 days ago
A simple local 3-approximation algorithm for vertex cover
We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxili...
Valentin Polishchuk, Jukka Suomela
CORR
2008
Springer
113views Education» more  CORR 2008»
14 years 17 days ago
Asymptotics of Entropy Rate in Special Families of Hidden Markov Chains
We generalize a result in [8] and derive an asymptotic formula for entropy rate of a hidden Markov chain around a "weak Black Hole". We also discuss applications of the ...
Guangyue Han, Brian Marcus