1379 search results - page 170 / 276 » The Complexity of the Annihilating Polynomial |
145
click to vote
IPPS
2007
IEEE
16 years 21 days ago
2007
IEEE
Recently, many parallel computing models using dynamically reconfigurable electrical buses have been proposed in the literature. The underlying characteristics are similar among ...
192
click to vote
CSL
2007
Springer
16 years 18 days ago
2007
Springer
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
142
click to vote
FUN
2007
Springer
16 years 17 days ago
2007
Springer
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...
147
click to vote
GECCO
2007
Springer
16 years 17 days ago
2007
Springer
It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no...
187
click to vote
Publication
We present a method for detecting and describing features in vector flow fields. Our method models flow fields locally using a linear combination of complex monomials. These monomi...