الصفحة 1
الصفحة 1
Mathematical Foundations of Computer Science 2007 ; 32nd International Symposium, MFCS 2007 Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings
This book constitutes the refereed proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007, held in Cesk?? Krumlov, Czech Republic, August 26-31, 2007. All current aspects in theoretical computer science and its mathematical foundations are addressed.
Mathematical foundations of computer science 2006 ; 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings
This book constitutes the refereed proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science, MFCS 2006, held in Stará Lesná, Slovakia in August/September 2006. The 62 revised full papers presented together with the full papers or abstracts of 7 invited talks were carefully reviewed and selected from 174 submissions. All current aspects in theoretical computer science and its mathematical foundations are addressed, ranging from algorithms and data structures, to complexity, automata, semantics, logic, formal specifications, models of computation, concurrency theory, computational geometry, parallel and distributed computing, networks, bioinformatics, quantum computing, cryptography, knowledge-based systems, and artificial intelligence.
LATIN 2006 : Theoretical Informatics ; 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings
This book constitutes the refereed proceedings of the 7th International Symposium, Latin American Theoretical Informatics, LATIN 2006, held in March 2006. The 66 revised full papers presented together with seven invited papers were carefully reviewed and selected from 224 submissions. The papers presented are devoted to a broad range of topics in theoretical computer science with a focus on algorithmics and computations related to discrete mathematics as well as on cryptography, data compression and Web applications.
Competitive Programming in Python : 128 Algorithms to Develop your Coding Skills
Learn all the algorithmic techniques and programming skills you need from two experienced coaches, problem setters, and jurors for coding competitions. The authors highlight the versatility of each algorithm by considering a variety of problems and show how to implement algorithms in simple and efficient code. What to expect: * Master 128 algorithms in Python. * Discover the right way to tackle a problem and quickly implement a solution of low complexity.
Automated deduction in Geometry ; 6th International Workshop, ADG 2006, Pontevedra, Spain, August 31-September 2, 2006, Revised Papers
The book show the lively variety of topics and methods and the current applicability of automated deduction in geometry to different branches of mathematics and to other sciences and technologies.
Automated deduction in Geometry ; 5th International Workshop, ADG 2004, Gainesville, FL, USA, September 16-18, 2004, Revised Papers
This book constitutes the thoroughly refereed post-proceedings of the 6th International Workshop on Automated Deduction in Geometry, ADG 2006, held at Pontevedra, Spain, in August/September 2006 as a satellite event of the International Congress of Mathematicians, ICM 2006. The 13 revised full papers presented were carefully selected from the submissions made due to a call for papers - within the scope of ADG - shortly after the meeting. The papers show the lively variety of topics and methods and the current applicability of automated deduction in geometry to different branches of mathematics and to other sciences and technologies.
Approximation, randomization and combinatorial optimization. algorithms and techniques ; 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings
This book constitutes the joint refereed proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008.
Algorithms for Sensor and Ad Hoc Networks : Advanced Lectures
Thousands of mini computers (comparable to a stick of chewing gum in size), equipped with sensors, are deployed in some terrain or other. After activation the sensors form a self-organized network and provide data, for example about a forthcoming earthquake. The trend towards wireless communication increasingly affects electronic devices in almost every sphere of life. Conventional wireless networks rely on infrastructure such as base stations; mobile devices interact with these base stations in a client/server fashion. In contrast, current research is focusing on networks that are completely unstructured, but are nevertheless able to communicate (via several hops) with each other, despite the low coverage of their antennas. Such systems are called sensor or ad hoc networks, depending on the point of view and the application. Wireless ad hoc and sensor networks have gained an incredible research momentum. Computer scientists and engineers of all flavors are embracing the area. Sensor networks have been adopted by researchers in many fields: from hardware technology to operating systems, from antenna design to databases, from information theory to networking, from graph theory to computational geometry.
Algorithms and data structures ; 9th international workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings
The papers in this volume were presented at the 9th Workshop on Algorithmsand Data Structures (WADS 2005). at the University of Waterloo, Waterloo, Canada. The workshopalternates with the Scandinavian Workshop on Algorithm Theory (SWAT), con-tinuing the tradition of SWAT and WADS starting with SWAT 1988 and WADS1989. From 90 submissions, the Program Committee selected 37 papers for pre-sentation at the workshop. includ Algorithm Analysis and Problem Complexity Data Structures Discrete Mathematics in Computer Science Computer Graphics Numeric Computing
Algorithms and data structures ; 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings
The book present research on the theory and application of algorithms and data structures in all areas, including combinatorics, computational geometry, databases, graphics, parallel and distributed computing.
Algorithms and computation ; Vol. 4288: 17th International symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings
This book constitutes the refereed proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC 2006, held in Kolkata, India in December 2006. The 73 revised full papers presented were carefully reviewed and selected from 255 submissions. The papers are organized in topical sections on algorithms and data structures, online algorithms, approximation algorithm, graphs, computational geometry, computational complexity, network, optimization and biology, combinatorial optimization and quantum computing, as well as distributed computing and cryptography.
Algorithms and computation ; Vol. 3827 ; 16th International symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings
This book constitutes the refereed proceedings of the 16th International Symposium on Algorithms and Computation, ISAAC 2005, held in China in 2005. The 112 revised full papers presented were carefully reviewed and selected from 549 submissions. The papers are organized in topical sections on computational geometry, computational optimization, graph drawing and graph algorithms, computational complexity, approximation algorithms, internet algorithms, quantum computing and cryptography, data structure, computational biology, experimental algorithm mehodologies and online algorithms, randomized algorithms, parallel and distributed algorithms, graph drawing and graph algorithms, computational complexity, combinatorial optimization, computational biology, computational complexity, computational optimization, computational geometry, approximation algorithms, graph drawing and graph algorithms, computational geometry, approximation algorithms, graph drawing and graph algorithms, and data structure.
Algorithms and computation ; 19th International symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings
This book constitutes the refereed proceedings of the 19th International Symposium on Algorithms and Computation, ISAAC 2008, held in Gold Coast, Australia in December 2008.
Algorithms and computation ; 18th International symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings
This book presented algorithms and data structures, online algorithms, approximation algorithm, graphs, computational geometry, computational complexity, network, optimization and biology, combinatorial optimization and quantum computing, as well as distributed computing and cryptography.
Algorithms and computation ; 15th international symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings
This volume contains the proceedings of the 15th Annual International Sym- sium on Algorithms and Computation (ISAAC 2004), held in Hong Kong, 2004. ISAAC is an annual international symposium that covers a wide range of topics,namelyalgorithmsandcomputation. aftar review process the committee selected 76 papers, the decisions being based on originality and relevance to the ?eld of algorithms and computation.
Algorithms and Complexity ; 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings
Here are the refereed proceedings of the 6th Italian Conference on Algorithms and Computation, CIAC 2006. The 33 revised full papers presented together with 3 invited papers address such topics as sequential, parallel and distributed algorithms, data structures, approximation algorithms, randomized algorithms, on-line algorithms, graph algorithms, analysis of algorithms, algorithm engineering, algorithmic game theory, computational biology, computational complexity, communication networks, computational geometry, cryptography, discrete optimization, graph drawing, mathematical programming, and quantum algorithms.
Algorithms – ESA 2005 ; 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings
This volume contains the 75 contributed papers and the abstracts of the threeinvited lectures presented at the 13th Annual European Symposium on Algo-rithms (ESA 2005), held in Spain, 2005. respectively.Papers were solicited in all areas of algorithmic research, including but notlimited to algorithmic aspects of networks, approximation and on-line algo-rithms, computational biology, computational geometry, computational financeand algorithmic game theory, data structures, database and information re-trieval, external memory algorithms, graph algorithms, graph drawing, machinelearning, mobile computing, pattern matching and data compression, quantumcomputing, and randomized algorithms. The algorithms could be sequential,distributed, or parallel. Submissions were especially encouraged in the area ofmathematical programming and operations research, including combinatorialoptimization, integer programming, polyhedral combinatorics, and semidefiniteprogramming.Each extended abstract was submitted to one of the two tracks.
Algorithmic Aspects in Information and Management ; Second International Conference, AAIM 2006, Hong Kong, China, June 20-22, 2006, Proceedings
This book constitutes the refereed proceedings of the Second International Conference on Algorithmic Aspects in Information and Management, AAIM 2006, held in Hong Kong, June 2006. The book presents 34 revised full papers together with abstracts of 2 invited talks. The papers cover topics from areas such as online scheduling, game and finance, data structures and algorithms, computational geometry, optimization, graph, and string, and more.
Algorithmic Aspects in Information and Management ; 3rd International Conference, AAIM 2007, Portland, OR, USA, June 6-8, 2007, Proceedings
This Book is intended for or- inal algorithmic research on immediate applications and/or fundamental pr- lems pertinent to information management and management science, broadly construed.
Algorithmic applications in management ; 1st international conference, AAIM 2005, Xian, China, June 22-25, 2005, Proceedings
The papers in this volume were presented at the 1st International Conference onAlgorithmic Applications in Management (AAIM 2005), in China. The topics cover algorithmic applications in most management-related areas.including Programming Techniques Business Strategy/Leadership Theory of Computation Algorithm Analysis and Problem Complexity Data Structures Discrete Mathematics in Computer Science
