Sciweavers

471 search results - page 83 / 95
» Computational complexity: a conceptual perspective
Sort
View
ATAL
2010
Springer
13 years 8 months ago
Path disruption games
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
Yoram Bachrach, Ely Porat
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
14 years 7 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami
PODS
2008
ACM
170views Database» more  PODS 2008»
14 years 7 months ago
Answering aggregate queries in data exchange
Data exchange, also known as data translation, has been extensively investigated in recent years. One main direction of research has focused on the semantics and the complexity of...
Foto N. Afrati, Phokion G. Kolaitis
BROADNETS
2005
IEEE
14 years 1 months ago
A Lightweight framework for source-to-sink data transfer in wireless sensor networks
— Lightweight protocols that are both bandwidth and power thrifty are desirable for sensor networks. In addition, for many sensor network applications, timeliness of data deliver...
James Jobin, Zhenqiang Ye, Honomount Rawat, Srikan...
ASWSD
2004
Springer
14 years 29 days ago
Simulink Integration of Giotto/TDL
The paper first presents the integration options of what we call the Timing Description Language (TDL) with MathWorks' Simulink tools. Based on the paradigm of logical executi...
Wolfgang Pree, Gerald Stieglbauer, Josef Templ