2638 search results - page 392 / 528 » Random Geometric Complexes |
172
click to vote
GECCO
2011
Springer
14 years 5 months ago
2011
Springer
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
172
click to vote
AAAI
2011
14 years 2 months ago
2011
Recently, a number of researchers have proposed spectral algorithms for learning models of dynamical systems—for example, Hidden Markov Models (HMMs), Partially Observable Marko...
113
Voted
IACR
2011
14 years 1 months ago
2011
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
166
click to vote
TEC
2012
13 years 4 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)...
118
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...