Sciweavers

314 search results - page 43 / 63
» A Comparison of Known Codes, Random Codes, and the Best Code...
Sort
View
JMLR
2011
111views more  JMLR 2011»
13 years 2 months ago
Models of Cooperative Teaching and Learning
While most supervised machine learning models assume that training examples are sampled at random or adversarially, this article is concerned with models of learning from a cooper...
Sandra Zilles, Steffen Lange, Robert Holte, Martin...
OPODIS
2010
13 years 5 months ago
On the Automated Implementation of Time-Based Paxos Using the IOA Compiler
Paxos is a well known algorithm for achieving consensus in distributed environments with uncertain processing and communication timing. Implementations of its variants have been s...
Chryssis Georgiou, Procopis Hadjiprocopiou, Peter ...
ICC
2007
IEEE
122views Communications» more  ICC 2007»
14 years 1 months ago
Evaluation of Clipped-OFDM and SC/FDE Alternatives for Block Transmission Using Iterative Receiver Techniques
— A CP-assisted (Cyclic Prefix) block transmission is widely accepted as a good choice for future mobile systems, taking advantage of low-cost, flexible, FFT-based (Fast Fourie...
Paulo Torres, António Gusmão
EUROGP
1998
Springer
113views Optimization» more  EUROGP 1998»
13 years 11 months ago
Fitness Causes Bloat: Mutation
The problem of evolving, using mutation, an artificial ant to follow the Santa Fe trail is used to study the well known genetic programming feature of growth in solution length. Kn...
William B. Langdon, Riccardo Poli
STACS
2004
Springer
14 years 25 days ago
Algorithms for SAT Based on Search in Hamming Balls
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
Evgeny Dantsin, Edward A. Hirsch, Alexander Wolper...