الصفحة 2
الصفحة 2
Fun with algorithms ; 4th International conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings
This book constitutes the refereed proceedings of the 4th International Conference on Fun with Algorithms, FUN 2007, held in Castiglioncello, Italy in June 2007.
Frontiers in Algorithmics ; 2nd Annual International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceeedings
This book constitutes the refereed proceedings of the Second International Frontiers of Algorithmics Workshop, FAW 2008, held in Changsha, China, in June 2008.The 33 revised full papers presented together with the abstracts of 3 invited talks were carefully reviewed and selected from 80 submissions. The papers were selected for 9 special focus tracks in the areas of biomedical informatics, discrete structures, geometric information processing and communication, games and incentive analysis.
Frontiers in Algorithmics ; 1st Annual International Workshop, FAW 2007, Lanzhou, China, August 1-3, 2007, Proceedings
This book constitutes the refereed proceedings of the First Annual International Frontiers of Algorithmics Workshop, FAW 2007, held in Lanzhou, China in August 2007. The 33 revised full papers presented were carefully reviewed and selected from 141 submissions.
Frontiers in Algorithmics ; 14th International Workshop, FAW 2020, Haikou, China, October 19-21, 2020, Proceedings
This book constitutes the proceedings of the 14th International Workshop on Frontiers in Algorithmics, FAW 2020, held in Haikou, China, in May 2020. The conference was held virtually due to the COVID-19 pandemic. The 12 full papers presented in this volume were carefully reviewed and selected from 15 submissions. The workshop provides a focused forum on current trends of research on algorithms, discrete structures, and their applications, and brings together international experts at the research frontiers in these areas to exchange ideas and to present significant new results. The papers detail graph theory, scheduling and algorithm and complexity.
Finite Elements III : First-Order and Time-Dependent PDEs
Volume III is divided into 28 chapters. The first eight chapters focus on the symmetric positive systems of first-order PDEs called Friedrichs' systems. This part of the book presents a comprehensive and unified treatment of various stabilization techniques from the existing literature. It discusses applications to advection and advection-diffusion equations and various PDEs written in mixed form such as Darcy and Stokes flows and Maxwell's equations. The remainder of Volume III addresses time-dependent problems: parabolic equations (such as the heat equation), evolution equations without coercivity (Stokes flows, Friedrichs' systems), and nonlinear hyperbolic equations (scalar conservation equations, hyperbolic systems). It offers a fresh perspective on the analysis of well-known time-stepping methods. The last five chapters discuss the approximation of hyperbolic equations with finite elements. Here again a new perspective is proposed.
Experimental Algorithms ; 7th International Workshop, WEA 2008 Provincetown, MA, USA, May 30-June 1, 2008 Proceedings
The Workshop on Experimental Algorithms, WEA, is intended to be an international forum for research on the experimental evaluation and engineering of algorithms, as well as in various aspects of computational optimization and its applications. The emphasis of the workshop is the use of experimental me- ods to guide the design, analysis, implementation, and evaluation of algorithms, heuristics, and optimization programs. WEA 2008 was held at the Provincetown Inn, Provincetown, MA, USA, on May 30 – June 1, 2008. This was the seventh workshop of the series.
Experimental Algorithms ; 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings
Fostering and disseminating high quality research results focused on the experimental analysis of algorithms the papers are devoted to the design, analysis, implementation, experimental evaluation, and engineering of efficient algorithms. Among the application areas addressed are most fields applying advanced algorithmic techniques, such as combinatorial optimization, approximation, graph theory, discrete mathematics, data mining, simulation, cryptography and security, scheduling, searching, sorting, string matching, coding, networking, etc.
Experimental Algorithms ; 5th International Workshop, WEA 2006, Cala Galdana, Menorca, Spain, May 24-27, 2006, Proceedings
This book constitutes the refereed proceedings of the 5th International Workshop on Experimental and Efficient Algorithms, WEA 2006, held in Cala Galdana, Menorca, Spain in May 2006. The 26 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 92 submissions. The book is devoted to the design, analysis, implementation, experimental evaluation, and engineering of efficient algorithms. Among the application areas addressed are most fields applying advanced algorithmic techniques.
Evolutionary Multi-Criterion Optimization ; 4th International Conference, EMO 2007, Matsushima, Japan, March 5-8, 2007, Proceedings
Multicriterion optimization refers to problems with two or more objectives (normally in conflict with each other) which must be simultaneously satisfied. Evolutionary algorithms have been used for solving multicriterion optimization problems for over two decades, gaining an increasing attention from industry. This book included four keynote speakers: Hirotaka Nakayama on aspiration level methods, Kay Chen Tan on large and computationally intensive real-world MO optimization problems, Carlos Fonseca on decision making, and Gary B. Lamont on design of large-scale network centric systems.
Evolutionary Multi-Criterion Optimization ; 3rd International Conference, EMO 2005, Guanajuato, Mexico, March 9-11, 2005, Proceedings
Constitutes the refereed proceedings of the Third International Conference on Evolutionary Multi-Criterion Optimization, EMO 2005, held in Guanajuato, Mexico, in March 2005.
Efficient Approximation and Online Algorithms : Recent Progress on Classical Combinatorial Optimization Problems and New Applications
This book provides a good opportunity for computer science practitioners and researchers to get in sync with current state-of-the-art and future trends in the field of combinatorial optimization and online algorithms. Recent advances in this area are presented focusing on the design of efficient approximation and on-line algorithms. One central idea in the book is to use a linear program relaxation of the problem, randomization and rounding techniques.
Distributed computing and networking ; 8th International conference, ICDCN 2006, Guwahati, India, December 27-30, 2006, Proceedings
VI realm between distributed computing and networking, namely, Modeling Biological Networks, Network Security, Algorithmic Issues in Wireless Sensor Networks, and Optical Networking. This was made possible by the efforts of the Tutorial Chairs, Sr- har Iyer and Pinaki Mitra. The Organizing Committee worked hard to ensure that the participants enjoyed a comfortable stay and the technical meetings proceeded as smoothly as possible.
Distributed computing ; Vol. 4167 ; 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings
DISC, the International Symposium on DIStributed Computing, is an annual forum for presentation of research on all facets of distributed computing, inc- ding the theory, design, analysis, implementation, and application of distributed systems and networks. The 20th anniversary edition of DISC was held on S- tember 18-20, 2006, in Stockholm, Sweden. There were 145 extended abstracts submitted to DISC this year, and this - lume contains the 35 contributions selected by the Program Committee and one invited paper among these 145 submissions.
Distributed Computing ; 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008. Proceedings
This book constitutes the refereed proceedings of the 22nd International Symposium on Distributed Computing, DISC 2008, held in Arcachon, France, in September 2008.
Distributed Computing ; 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings
This book covers all current issues in distributed computing, including theory, design, analysis, implementation, and application of distributed systems and networks.
Discrete and computational geometry; Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004
This book constitutes the thoroughly refereed post-proceedings of the Japanese Conference on Discrete Computational Geometry, JCDCG 2004, held in Tokyo, Japan in October 2004, to honor Janos Pach on his fiftieth year. The 20 revised full papers presented were carefully selected during two rounds of reviewing and improvement from over 60 talks at the conference. All current issues in discrete algorithmic geometry are addressed.
Computing and Combinatorics ; Vol. 4112 ; 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings
The papers are organized in topical sections on computational economics, finance, and management, graph algorithms, computational complexity and computability, quantum computing, computational biology and medicine, computational geometry, graph theory, and more.
Computing and Combinatorics ; 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings
The Book covers most aspects of theoretical computer scienceand combinatorics related to computing.It exploring research, development, and novel applications of computing and combinatorics.
Computer science : Theory and applications ; 15th International computer science symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020, Proceedings
This book constitutes the proceedings of the 15th International Computer Science Symposium in Russia, CSR 2020, held in Yekaterinburg, Russia, in June 2020. The 25 full papers and 6 invited papers were carefully reviewed and selected from 49 submissions. The papers cover a broad range of topics, such as: algorithms and data structures; computational complexity, including hardness of approximation and parameterized complexity; randomness in computing, approximation algorithms, fixed-parameter algorithms; combinatorial optimization, constraint satisfaction, operations research; computational geometry; string algorithms; formal languages and automata, including applications to computational linguistics; codes and cryptography; combinatorics in computer science; computational biology; applications of logic to computer science, proof complexity; database theory; distributed computing; fundamentals of machine learning, including learning theory, grammatical inference and neural computing; computational social choice; quantum computing and quantum cryptography; theoretical aspects of big data.
Computational Geometry and Graph Theory ; International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers
This book constitutes the thoroughly refereed post-conference proceedings of the Kyoto Conference on Computational Geometry and Graph Theory, KyotoCGGT 2007, held in Kyoto, Japan, in June 2007.
