Sciweavers

2233 search results - page 86 / 447
» On the Complexity of Theory Curbing
Sort
View
ACSD
2005
IEEE
114views Hardware» more  ACSD 2005»
15 years 12 months ago
Controlling Speculative Design Processes Using Rich Component Models
This paper elaborates on the application of some aspects of robust systems control theory to the management of uncertainty and risk in distributed and complex design processes, ha...
Werner Damm
COCO
2001
Springer
102views Algorithms» more  COCO 2001»
15 years 10 months ago
Separation of NP-Completeness Notions
We use hypotheses of structural complexity theory to separate various NP-completeness notions. In particular, we introduce an hypothesis from which we describe a set in NP that is...
Aduri Pavan, Alan L. Selman
LOGCOM
2007
92views more  LOGCOM 2007»
15 years 6 months ago
Third-Order Computation and Bounded Arithmetic
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...
Alan Skelley
ICASSP
2011
IEEE
14 years 10 months ago
Hardware architectures for successive cancellation decoding of polar codes
The recently-discovered polar codes are widely seen as a major breakthrough in coding theory. These codes achieve the capacity of many important channels under successive cancella...
Camille Leroux, Ido Tal, Alexander Vardy, Warren J...
DISOPT
2011
201views Education» more  DISOPT 2011»
14 years 9 months ago
The Wiener maximum quadratic assignment problem
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
Eranda Çela, Nina S. Schmuck, Shmuel Wimer,...