2168 search results - page 248 / 434 » Randomized Algorithms and Complexity Theory |
108
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
We consider the multiple-access communication problem in a distributed setting for both the additive white Gaussian noise channel and the discrete memoryless channel. We propose a ...
124
Voted
TCAD
2008
15 years 3 months ago
2008
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...
122
Voted
TCS
2008
15 years 3 months ago
2008
Studying the learnability of classes of recursive functions has attracted considerable interest for at least four decades. Starting with Gold's (1967) model of learning in th...
130
Voted
MIS
2007
Springer
15 years 3 months ago
2007
Springer
Mobility models, synthetic or trace, try to accurately model the movement of a single user or a group of users. Models are used in simulators and emulators to investigate the cons...
146
click to vote
QUESTA
2007
15 years 3 months ago
2007
Obtaining (tail) probabilities from a transform function is an important topic in queueing theory. To obtain these probabilities in discrete-time queueing systems, we have to inve...