Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

DAM
2008

favoriteEmaildiscussreport

73views more DAM 2008»

Searching with lies under error cost constraints

13 years 4 months ago

Searching with lies under error cost constraints

Download www.math.uni-bielefeld.de

The R

Rudolf Ahlswede, Ferdinando Cicalese, Christian De

Real-time Traffic

Classical Model | DAM 2008 | Minimum Number | R´enyi-Berlekamp-Ulam Game |

claim paper

Related Content

» Finding mobile data under delay constraints with searching costs

» Distributed Forward Checking May Lie for Privacy

» LieAlgebraic Averaging for Globally Consistent Motion Estimation

» Trading off solution cost for smaller runtime in DCOP search algorithms

» Task Assignment and Scheduling under Memory Constraints

» Exact Arithmetic at Low Cost A Case Study in Linear Programming

» Mobile texting can postASR correction solve the issues an experimental study on gain vs co...

» The effect of communication costs in solidstate quantum computing architectures

» Simultaneous Segmentation of Multiple Closed Surfaces Using Optimal Graph Searching

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	DAM
Authors	Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe

Comments (0)