Ergebnisse für: Algorithm Analysis and Problem Complexity
Hier findest Du Bücher, die sich mit Algorithm Analysis and Problem Complexity beschäftigen.
Carlos A. Berenstein has had a profound influence on scholars and practitioners alike amid a distinguished mathematical career spanning nearly four decades. His uncommon capability of adroitly moving between these parallel worlds is demonstrated by the breadth of his research interests, from his ear...
In this work we plan to revise the main techniques for enumeration algorithms and to show four examples of enumeration algorithms that can be applied to efficiently deal with some biological problems modelled by using biological networks: enumerating central and peripheral nodes of a network, enumer...
Carlos A. Berenstein has had a profound influence on scholars and practitioners alike amid a distinguished mathematical career spanning nearly four decades. His uncommon capability of adroitly moving between these parallel worlds is demonstrated by the breadth of his research interests, from his ear...
This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California,...
This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California,...
Un système dynamique discret est un ensemble fini d'éléments, prenant chacun un nombre fini d'états, et evoluant, dans un temps discret, par interactions mutuelles. Ce livre est consacré a l'analyse de la dynamique temporelle de tels systèmes. Grâce à des outils de métrique discrète, on é...
The workshop on Computability and Complexity in Analysis, CCA 2000, was hosted by the Department of Computer Science of the University of Wales Swansea, September 17{19, 2000. It was the fourth workshop in a successful series of workshops: CCA’95 in Hagen, Germany, CCA’96 in Trier, Germany, and ...
The workshop on Computability and Complexity in Analysis, CCA 2000, was hosted by the Department of Computer Science of the University of Wales Swansea, September 17{19, 2000. It was the fourth workshop in a successful series of workshops: CCA’95 in Hagen, Germany, CCA’96 in Trier, Germany, and ...
In this work we plan to revise the main techniques for enumeration algorithms and to show four examples of enumeration algorithms that can be applied to efficiently deal with some biological problems modelled by using biological networks: enumerating central and peripheral nodes of a network, enumer...
The two-volume set LNCS 6753/6754 constitutes the refereed proceedings of the 8th International Conference on Image and Recognition, ICIAR 2011, held in Burnaby, Canada, in June 2011. The 84 revised full papers presented were carefully reviewed and selected from 147 submissions. The papers are organ...
The two-volume set LNCS 7324/7325 constitutes the refereed proceedings of the 9th International Conference on Image and Recognition, ICIAR 2012, held in Aveiro, Portugal, in June 2012. The 107 revised full papers presented were carefully reviewed and selected from 207 submissions. The papers are org...
The two-volume set LNCS 7324/7325 constitutes the refereed proceedings of the 9th International Conference on Image and Recognition, ICIAR 2012, held in Aveiro, Portugal, in June 2012. The 107 revised full papers presented were carefully reviewed and selected from 207 submissions. The papers are org...