Sciweavers

451 search results - page 31 / 91
» On Parameterized Exponential Time Complexity
Sort
View
RTSS
2008
IEEE
14 years 4 months ago
Priority Assignment for Real-Time Wormhole Communication in On-Chip Networks
—Wormhole switching with fixed priority preemption has been proposed as a possible solution for real-time on-chip communication. However, none of current priority assignment pol...
Zheng Shi, Alan Burns
GLOBECOM
2009
IEEE
14 years 1 months ago
A Subspace Method for the Blind Identification of Multiple Time-Varying FIR Channels
A new method is proposed for the blind subspace-based identification of the coefficients of time-varying (TV) single-input multiple-output (SIMO) FIR channels. The TV channel coef...
Benoît Champagne, Amr El-Keyi, Chao-Cheng Tu
FOCS
2009
IEEE
14 years 4 months ago
The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems
— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...
Daniel Gottesman, Sandy Irani
UAI
1998
13 years 11 months ago
Tractable Inference for Complex Stochastic Processes
The monitoring and control of any dynamic system depends crucially on the ability to reason about its current status and its future trajectory. In the case of a stochastic system,...
Xavier Boyen, Daphne Koller
IJCGA
2010
155views more  IJCGA 2010»
13 years 8 months ago
Competitive Complexity of Mobile Robot on-Line Motion Planning Problems
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
Yoav Gabriely, Elon Rimon