Sciweavers

1139 search results - page 194 / 228
» Bounded Ideation Theory
Sort
View
ECRTS
2010
IEEE
13 years 8 months ago
Making DRAM Refresh Predictable
Embedded control systems with hard real-time constraints require that deadlines are met at all times or the system may malfunction with potentially catastrophic consequences. Sched...
Balasubramanya Bhat, Frank Mueller
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 7 months ago
Phase Transitions for Greedy Sparse Approximation Algorithms
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner...
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 7 months ago
Deploying Wireless Networks with Beeps
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
Alejandro Cornejo, Fabian Kuhn
COR
2008
122views more  COR 2008»
13 years 7 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 7 months ago
Distributed Source Coding using Abelian Group Codes
In this work, we consider a distributed source coding problem with a joint distortion criterion depending on the sources and the reconstruction. This includes as a special case the...
Dinesh Krithivasan, S. Sandeep Pradhan