2899 search results - page 80 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
104
click to vote
STOC
1989
ACM
15 years 5 months ago
1989
ACM
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division nding reciprocals that...
111
click to vote
STOC
2006
ACM
16 years 1 months ago
2006
ACM
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
117
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
We have recently proposed an EM-style algorithm to optimize log-linear models with hidden variables. In this paper, we use this algorithm to optimize a hidden conditional random ï...
160
click to vote
TEC
2012
13 years 3 months ago
2012
—This paper presents a new cooperative coevolving particle swarm optimization (CCPSO) algorithm in an attempt to address the issue of scaling up particle swarm optimization (PSO)...
102
click to vote
CEC
2010
IEEE
15 years 2 months ago
2010
IEEE
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...