2412 search results - page 170 / 483 » Which Problems Have Strongly Exponential Complexity |
178
click to vote
DAC
1994
ACM
15 years 7 months ago
1994
ACM
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veri cation problems. Recently, we ha...
150
Voted
ATAL
2011
Springer
14 years 3 months ago
2011
Springer
We consider a setting in which a principal seeks to induce an adaptive agent to select a target action by providing incentives on one or more actions. The agent maintains a belief...
132
Voted
CP
2003
Springer
15 years 8 months ago
2003
Springer
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
116
Voted
CISS
2007
IEEE
15 years 10 months ago
2007
IEEE
— In recent years, coherent space-frequency (SF) coded multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems have attracted great attentio...
138
Voted
TEC
2010
14 years 10 months ago
2010
This paper identifies five distinct mechanisms by which a population-based algorithm might have an advantage over a solo-search algorithm in classical optimization. These mechanism...