This volume contains the proceedings of the 21st Annual International S- posium on Algorithms and Computations (ISAAC 2010), held in Jeju, Korea during December 15 17, 2010. Past editions have been held in Tokyo, Taipei, Nagoya, HongKong, Beijing, Cairns, Osaka, Singapore, Taejon, Chennai, Taipei, Christchurch, Vancouver, Kyoto, Hong Kong, Hainan, Kolkata, Sendai, Gold Coast, and Hawaii over the years 1990-2009. ISAACis anannualinternationalsymposiumthatcoversthe verywide range of topics in algorithms and computation. The main purpose of the symposium is to provide a forum for researchers working in algorithms and the theory of computation where they can exchange ideas in this active research community. In response to the call for papers, ISAAC 2010 received 182 papers. Each submission was reviewed by at least three Program Committee members with the assistance of external referees. Since there were many high-quality papers, the Program Committee s task was extremely di?cult. Through an extensive discussion, the Program Committee accepted 77 of the submissions to be p- sented at the conference. Two special issues, one of Algorithmica and one of the International Journal of Computational Geometry and Applications, were prepared with selected papers from ISAAC 2010. The best paper award was given to From Holant to #CSP and Back: c DichotomyforHolant Problems byJin-YiCai, SangxiaHuangandPinyanLu, and the best student paper award to Satis?ability with Index Dependency by Hongyu Liang and Jing He. Two eminent invited speakers, David Eppstein from UniversityofCalifornia, Irvine, andMattFranklinfromUniversityofCalifornia, Davis, also contributed to this volume."
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Etat : New. N° de réf. du vendeur ABLIING23Mar3113020220029
Quantité disponible : 1 disponible(s)
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
Paperback. Etat : new. Paperback. This volume contains the proceedings of the 21st Annual International S- posium on Algorithms and Computations (ISAAC 2010), held in Jeju, Korea during December 15-17, 2010. Past editions have been held in Tokyo, Taipei, Nagoya,HongKong,Beijing,Cairns,Osaka,Singapore,Taejon,Chennai,Taipei , Christchurch, Vancouver, Kyoto, Hong Kong, Hainan, Kolkata, Sendai, Gold Coast, and Hawaii over the years 1990-2009. ISAACis anannualinternationalsymposiumthatcoversthe verywide range of topics in algorithms and computation. The main purpose of the symposium is to provide a forum for researchers working in algorithms and the theory of computation where they can exchange ideas in this active research community. In response to the call for papers, ISAAC 2010 received 182 papers. Each submission was reviewed by at least three Program Committee members with the assistance of external referees. Since there were many high-quality papers, the Program Committee's task was extremely di?cult. Through an extensive discussion, the Program Committee accepted 77 of the submissions to be p- sented at the conference.Two special issues, one of Algorithmica and one of the International Journal of Computational Geometry and Applications,were prepared with selected papers from ISAAC 2010. The best paper award was given to "From Holant to #CSP and Back: c DichotomyforHolant Problems"byJin-YiCai,SangxiaHuangandPinyanLu, and the best student paper award to "Satis?ability with Index Dependency" by Hongyu Liang and Jing He. Two eminent invited speakers,David Eppstein from UniversityofCalifornia,Irvine,andMattFranklinfromUniversityofCalifornia, Davis, also contributed to this volume. Constitutes the refereed proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC 2010, held in Jeju, South Korea in December 2010. This volume contains topics such as approximation algorithm; complexity; data structure and algorithm; combinatorial optimization; graph algorithm; and, computational geometry. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9783642175169
Quantité disponible : 1 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Paperback. Etat : Brand New. 1st edition. 483 pages. 9.00x6.00x1.00 inches. In Stock. N° de réf. du vendeur x-3642175163
Quantité disponible : 2 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. Invited Talks.- Regular Labelings and Geometric Structures.- Algorithmic Aspects of Secure Computation and Communication.- Session 1A. Approximation Algorithm I.- Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tou. N° de réf. du vendeur 5051455
Quantité disponible : 3 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. Neuware - This book constitutes the refereed proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC 2010, held in Jeju, South Korea in December 2010.The 77 revised full papers presented were carefully reviewed and selected from 182 submissions for inclusion in the book. This volume contains topics such as approximation algorithm; complexity; data structure and algorithm; combinatorial optimization; graph algorithm; computational geometry; graph coloring; fixed parameter tractability; optimization; online algorithm; and scheduling. N° de réf. du vendeur 9783642175169
Quantité disponible : 2 disponible(s)