1552 search results - page 52 / 311 » On the Complexity of Constant Propagation |
109
click to vote
TWC
2008
15 years 1 months ago
2008
Wireless networks, and especially wireless sensor networks, have complexity and energy constraints, within which they must confront the challenging wireless fading environment. In ...
107
click to vote
COCO
2006
Springer
15 years 5 months ago
2006
Springer
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...
150
click to vote
HYBRID
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. We define a new class of hybrid automata for which reachability is decidable--a proper superclass of the initialized rectangular hybrid automata--by taking parallel compo...
120
click to vote
FOCS
1994
IEEE
15 years 6 months ago
1994
IEEE
Sipser and Spielman have introduced a constructive family of asymptotically good linear error-correcting codes--expander codes--together with a simple parallel algorithm that will ...
130
click to vote
STACS
2009
Springer
15 years 8 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...