2899 search results - page 44 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
ICFEM
2009
Springer
14 years 11 months ago
2009
Springer
One of the most important open problems of parallel LTL model-checking is to design an on-the-fly scalable parallel algorithm with linear time complexity. Such an algorithm would g...
114
click to vote
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
Due to computational intractability, large scale coordination algorithms are necessarily heuristic and hence require tuning for particular environments. In domains where character...
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
This paper uses an entertaining student "sports" game to illustrate that GAs can be adapted to problems with uncertain properties and complexity. These problems can be s...
104
click to vote
ICPP
2007
IEEE
15 years 7 months ago
2007
IEEE
Sequence alignment is a fundamental problem in the computational biology. Many alignment methods have been proposed in the literature, such as pair-wise sequence alignment (2SA), ...
ISCAS
2006
IEEE
15 years 7 months ago
2006
IEEE
— We present analytical formulas for the calculation of the memory requirements for a system using the Complex Logarithmic Number System (CLNS). Certain properties of the CLNS ad...