Sciweavers

1355 search results - page 218 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
SIGMETRICS
2010
ACM
173views Hardware» more  SIGMETRICS 2010»
14 years 15 days ago
Channel fragmentation in dynamic spectrum access systems: a theoretical study
Dynamic Spectrum Access systems exploit temporarily available spectrum (‘white spaces’) and can spread transmissions over a number of non-contiguous sub-channels. Such methods...
Edward G. Coffman Jr., Philippe Robert, Florian Si...
NEUROSCIENCE
2001
Springer
14 years 4 days ago
Analysis and Synthesis of Agents That Learn from Distributed Dynamic Data Sources
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
Doina Caragea, Adrian Silvescu, Vasant Honavar
SOFSEM
2000
Springer
13 years 11 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
CCR
2008
84views more  CCR 2008»
13 years 7 months ago
Modeling internet topology dynamics
Despite the large number of papers on network topology modeling and inference, there still exists ambiguity about the real nature of the Internet AS and router level topology. Whi...
Hamed Haddadi, Steve Uhlig, Andrew W. Moore, Richa...
INFOCOM
2009
IEEE
14 years 2 months ago
Online Bipartite Perfect Matching With Augmentations
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
Kamalika Chaudhuri, Constantinos Daskalakis, Rober...