Sciweavers

948 search results - page 8 / 190
» What can we achieve by arbitrary announcements
Sort
View
ICC
2009
IEEE
120views Communications» more  ICC 2009»
13 years 5 months ago
Achieving Exponential Diversity in Wireless Multihop Systems with Regenerative Relays
Abstract--We present and analyze two different power allocation strategies for considerably improving the average bit error rate (BER) performance of wireless multihop systems with...
Andreas Müller 0001, Joachim Speidel
KDID
2003
144views Database» more  KDID 2003»
13 years 8 months ago
What You Store is What You Get
d abstract) Floris Geerts, Bart Goethals, and Taneli Mielik¨ainen HIIT Basic Research Unit Department of Computer Science University of Helsinki, Finland Abstract. Recent studies ...
Floris Geerts, Bart Goethals, Taneli Mielikäi...
ICSE
2003
IEEE-ACM
14 years 21 days ago
Achieving Critical System Survivability Through Software Architectures
Software-intensive systems often exhibit dimensions in size and complexity that exceed the scope of comprehension of even talented, experienced system designers and analysts. With ...
John C. Knight, Elisabeth A. Strunk
JOLLI
2008
145views more  JOLLI 2008»
13 years 7 months ago
Temporal Languages for Epistemic Programs
This paper adds temporal logic to public announcement logic (PAL) and dynamic epistemic logic (DEL). By adding a previous-time operator to PAL, we express in the language statemen...
Joshua Sack
ALT
2010
Springer
13 years 9 months ago
Bayesian Active Learning Using Arbitrary Binary Valued Queries
We explore a general Bayesian active learning setting, in which the learner can ask arbitrary yes/no questions. We derive upper and lower bounds on the expected number of queries r...
Liu Yang, Steve Hanneke, Jaime G. Carbonell