الصفحة 1
الصفحة 1
Internet and Network Economics ; Vol. 4286 ; 2nd International Workshop, WINE 2006, Patras, Greece, December 15-17, 2006, Proceedings
Constitutes the refereed proceedings of the Second International Workshop on Internet and Network Economics, WINE 2006, held in Patras, Greece in December 2006. The 32 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 79 submissions. The papers contain foundational and mathematical work from theories, methodologies, and applications in computer science, economics, mathematics, and management sciences for solving problems arisen in internet technologies, grid computing, network communication protocols, as well as social economic issues in virtual communities enabled through the World Wide Web.
Internet and network economics ; 4th International Workshop, WINE 2008, Shanghai, China, December 17-20, 2008. Proceedings
This book constitutes the refereed proceedings of the 4th International Workshop on Internet and Network Economics, WINE 2008, held in Shanghai, China, in December 2008.The 68 revised full papers presented together with 10 invited talks were carefully reviewed and selected from 126 submissions. The papers are organized in topical sections on market equilibrium, congestion games, information markets, nash equilibrium, network games, solution concepts, algorithms and optimization, mechanism design, equilibrium, online advertisement, sponsored search auctions, and voting problems.
Internet and Network Economics ; 3rd International Workshop,WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings
This book constitutes the refereed proceedings of the Third International Workshop on Internet and Network Economics, WINE 2007, held in San Diego, CA, USA, in December 2007.
Integer Programming and Combinatorial Optimization ; 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings
Since its start in 1990, the IPCO conference series (held under the auspices of theMathematicalProgrammingSociety)hasbecomeanimportantforumforthe presentation of recent results in Integer Programming and Combinatorial Op- mization. This volume compiles the papers presented at IPCO XI, the eleventh conference in this series, held June 8–10, 2005, at the Technische Universit¨ at Berlin. The high interest in this conference series is evident in the large number of submissions. For IPCO XI, 119 extended abstracts of up to 10 pages were submitted. During its meeting on January 29–30, 2005, the Program Committee carefully selected 34 contributions for presentation in non-parallel sessions at the conference. The ?nal choices were not easy at all, since, due to the limited number of time slots, many very good papers could not be accepted. During the selection process the contributions were refereed according to the standards of refereed conferences. As a result of this procedure, you have in your hands a volume that contains papers describing high-quality research e?orts. The page limit for contributions to this proceedings volume was set to 15. You may ?nd full versions of the papers in scienti?c journals in the near future. We thank all the authors who submitted papers. Furthermore, the Program Committee is indebted to the many reviewers who, with their speci?c expertise, helped a lot in making the decisions.
Hybrid metaheuristics ; Vol. 4030 ; 3rd International Workshop, HM 2006, Gran Canaria, Spain, October 13-14, 2006, Proceedings
The selection of papers for HM 2006 consolidated some of the mainstream issues that have emerged from the past editions. Firstly, there are prominent examples of e?ective hybrid techniques whose design and implementation were motivated by challenging real-world applications. We believe this is particularly important for two reasons: on the one hand, researchers are conscious that the primary goal of developing algorithms is to solve relevant real-life problems; on the other hand, the path towarde?cient solving methods for practical problems is a source of new outstanding ideas and theories. A second important issue is that the research community on metaheur- tics has become increasingly interested in and open to techniques and methods known from arti?cial intelligence (AI) and operations research (OR). So far, the most representative examples of such integration have been the use of AI/OR techniques as subordinates of metaheuristic methods. As a historical and - ymological note, this is in perfect accordance with the original meaning of a metaheuristic as a “general strategy controlling a subordinate heuristic. ” The awareness of the need for a sound experimental methodology is a third keypoint.
Hybrid metaheuristics ; Vol. 3636 ; 2nd International Workshop, HM 2005, Barcelona, Spain, August 29-30, 2005. Proceedings
Constitutes the refereed proceedings of the Second International Workshop on Hybrid Metaheuristics, HM 2005, held in Barcelona, Spain, in August 2005. In this book, the papers addresses topics such as: low-level hybridization, high-level hybridization, portfolio techniques, expert systems, co-operative search, taxonomy, terminology, and more.
Hybrid metaheuristics ; 4th International Workshop,HM 2007, Dortmund, Germany, October 8-9, 2007, Proceedings
This book constitutes the refereed proceedings of the 4th International Workshop on Hybrid Metaheuristics, HM 2007, held in Dortmund, Germany. The 14 revised full papers discuss specific aspects of hybridization of metaheuristics, hybrid metaheuristics design, development and testing.
Graph-theoretic concepts in computer science ; 46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers
This book constitutes the revised papers of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2020, held in Leeds, UK, in June 2020. The workshop was held virtually due to the COVID-19 pandemic. The 32 full papers presented in this volume were carefully reviewed and selected from 94 submissions. They cover a wide range of areas, aiming to present emerging research results and to identify and explore directions of future research of concepts on graph theory and how they can be applied to various areas in computer science.
Fundamentals of computation theory ; 15th International symposium, FCT 2005, Lübeck, Gemany, August 17-20, 2005, Proceedings
This book constitutes the refereed proceedings of the 15th International Symposium Fundamentals of Computation Theory, FCT 2005, held in L]beck, Germany in August 2005. The 46 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 105 submissions. The papers are organized in topical sections on circuits, automata, complexity, approximability, computational and structural complexity, graphs and complexity, computational game theory, visual cryptography and computational geometry, query complexity, distributed systems, automata and formal languages, semantics, approximation algorithms, average case complexity, algorithms, graph algorithms, and pattern matching.
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.
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.
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.
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.
Combinatorial optimization and applications ; 14th International Conference, COCOA 2020, Dallas, TX, USA, December 11–13, 2020, Proceedings
This volume constitutes the proceedings of the 14th International Conference on Combinatorial Optimization and Applications, COCOA 2020, held in Dallas, TX, USA, in December 2020. The 55 full papers presented in this volume were carefully reviewed and selected from 104 submissions. The papers are grouped into the following topics: Approximation Algorithms; Scheduling; Network Optimization; Complexity and Logic; Search, Facility and Graphs; Geometric Problem; Sensors, Vehicles and Graphs; and Graph Problems.
