1552 search results - page 229 / 311 » On the Complexity of Constant Propagation |
193
click to vote
ICIC
2009
Springer
16 years 1 months ago
2009
Springer
Genetic Programming(GP) can obtain a program structure to solve complex problem. This paper presents a new form of Genetic Programming, Function Sequence Genetic Programming (FSGP)...
166
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
180
click to vote
TAMC
2009
Springer
16 years 29 days ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
154
click to vote
CDC
2008
IEEE
16 years 28 days ago
2008
IEEE
— A predictive outage compensator co-located with the actuator node in a networked control system can be used to counteract unpredictable losses of data in the feedback control l...
159
click to vote
CISS
2008
IEEE
16 years 28 days ago
2008
IEEE
Abstract— The objective of this paper is the linear reconstruction of a vector, up to a unimodular constant, when all phase information is lost, meaning only the magnitudes of fr...