Sciweavers

43264 search results - page 156 / 8653
» Comparing models of computation
Sort
View
ENGL
2008
170views more  ENGL 2008»
13 years 10 months ago
Design of Reversible/Quantum Ternary Comparator Circuits
Multiple-valued quantum circuits are promising choices for future quantum computing technology, since the multiple-valued quantum system is more compact than the corresponding bina...
Mozammel H. A. Khan
SIGPRO
2011
209views Hardware» more  SIGPRO 2011»
13 years 5 months ago
Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
A. Rakotomamonjy
FORTE
2010
13 years 11 months ago
On Efficient Models for Model Checking Message-Passing Distributed Protocols
Abstract. The complexity of distributed algorithms, such as state machine replication, motivates the use of formal methods to assist correctness verification. The design of the for...
Péter Bokor, Marco Serafini, Neeraj Suri
CEC
2009
IEEE
14 years 4 months ago
Comparing parameter tuning methods for evolutionary algorithms
Abstract— Tuning the parameters of an evolutionary algorithm (EA) to a given problem at hand is essential for good algorithm performance. Optimizing parameter values is, however,...
Selmar K. Smit, A. E. Eiben
WABI
2009
Springer
156views Bioinformatics» more  WABI 2009»
14 years 4 months ago
Phylogenetic Comparative Assembly
Recent high throughput sequencing technologies are capable of generating a huge amount of data for bacterial genome sequencing projects. Although current sequence assemblers succes...
Peter Husemann, Jens Stoye