Sciweavers

6059 search results - page 1162 / 1212
» A Technique for Verifying Measurements
Sort
View
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 years 3 months ago
On the Communication Complexity of Read-Once AC^0 Formulae
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
T. S. Jayram, Swastik Kopparty, Prasad Raghavendra
ATAL
2006
Springer
15 years 3 months ago
Examining DCSP coordination tradeoffs
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
Michael Benisch, Norman M. Sadeh
ATAL
2006
Springer
15 years 3 months ago
Accident or intention: that is the question (in the Noisy Iterated Prisoner's Dilemma)
This paper focuses on the Noisy Iterated Prisoner's Dilemma, a version of the Iterated Prisoner's Dilemma (IPD) in which there is a nonzero probability that a "coop...
Tsz-Chiu Au, Dana S. Nau
CLEF
2006
Springer
15 years 3 months ago
Overview of WebCLEF 2006
We report on the CLEF 2006 WebCLEF track devoted to crosslingual web retrieval. We provide details about the retrieval tasks, the used topic set, and the results of WebCLEF partic...
Krisztian Balog, Leif Azzopardi, Jaap Kamps, Maart...
87
Voted
CLEF
2006
Springer
15 years 3 months ago
CLEF-2006 CL-SR at Maryland: English and Czech
The University of Maryland participated in the English and Czech tasks. For English, one monolingual run using only fields based on fully automatic transcription (the required con...
Jianqiang Wang, Douglas W. Oard
« Prev « First page 1162 / 1212 Last » Next »