You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
WINE 2005, the First Workshop on Internet and Network Economics (WINE 2005), took place in Hong Kong, China, December 15-17, 2005. The symposium aims to provide a forum for researchers working in Internet and Network Economic algorithms from all over the world. The final count of electronic submissions was 372, of which 108 were accepted. It consists of the main program of 31 papers, of which the submitter email accounts are: 10 from edu (USA) accounts, 3 from hk (Hong Kong), 2 each from il (Isreal), cn (China), ch (Switzerland), de (Germany), jp (Japan), gr (Greece), 1 each from hp. com, sohu. com, pl (Poland), fr (France), ca (Canada), and in (India). In addition, 77 papers from 20 countri...
Distributed and multi-agent systems are becoming more and more the focus of attention in artificial intelligence research and have already found their way into many practical applications. An important prerequisite for their success is an ability to flexibly adapt their behavior via intelligent cooperation. Successful reasoning about and within a multiagent system is therefore paramount to achieve intelligent behavior. Distributed Constraint Satisfaction Problems (DCSPs) and Distributed Constraint Optimization (minimization) Problems (DCOPs) are perhaps ubiquitous in distributed systems in dynamic environments. Many important problems in distributed environments and systems, such as action c...
As research progresses, it enables multi-robot systems to be used in more and more complex and dynamic scenarios. Hence, the question arises how different modelling and reasoning paradigms can be utilised to describe the intended behaviour of a team and execute it in a robust and adaptive manner. Hendrik Skubch presents a solution, ALICA (A Language for Interactive Cooperative Agents) which combines modelling techniques drawn from different paradigms in an integrative fashion. Hierarchies of finite state machines are used to structure the behaviour of the team such that temporal and causal relationships can be expressed. Utility functions weigh different options against each other and assign agents to different tasks. Finally, non-linear constraint satisfaction and optimisation problems are integrated, allowing for complex cooperative behaviour to be specified in a concise, theoretically well-founded manner.
The 10th International Conference on the Principles and Practice of Constraint Programming (CP 2003) was held in Toronto, Canada, during September 27 – October 1, 2004. Information about the conference can be found on the Web at http://ai.uwaterloo.ca/~cp2004/ Constraint programming (CP) is about problem modelling, problem solving, programming, optimization, software engineering, databases, visualization, user interfaces, and anything to do with satisfying complex constraints. It reaches into mathematics, operations research, arti?cial intelligence, algorithms, c- plexity, modelling and programming languages, and many aspects of computer science. Moreover, CP is never far from applications...
The present volume focuses on the relationship with Communism of Romania's most important religious denominations and their attempt to cope with that difficult past which continues to cast an important shadow over their present. For the first time ever, this volume considers both the majority Romanian Orthodox Church and significant minority denominations such as the Roman and Greek Catholic Churches, the Reformed Church, the Hungarian Unitarian Church, and the Pentecostal Christian Denomination. It argues that no religious group escaped collaboration with the Communists. After 1989, however, most denominations had little desire to tackle their tainted past and make a clean start. In part, this situation was facilitated by the country's deficient legislation that did not encourage the pursuit of lustration, which in turn did not lead to a serious movement of elite renewal in the religious realm. Instead, a strong process of reproduction of the old elites and their adaptation to democracy has been the dominant characteristic of the post-Communist period.
This volume contains the proceedings of the Ninth International Conference on Principles and Practice of Constraint Programming (CP 2003), held in Kinsale, Ireland, from September 29 to October 3, 2003. Detailed information about the CP 2003 conference can be found at the URL http://www.cs.ucc.ie/cp2003/ The CP conferences are held annually and provide an international forum for the latest results on all aspects of constraint programming. Previous CP conferences were held in Cassis (France) in 1995, in Cambridge (USA) in 1996, in Schloss Hagenberg (Austria) in 1997, in Pisa (Italy) in 1998, in Alexandria (USA) in 1999, in Singapore in 2000, in Paphos (Cyprus) in 2001, and in Ithaca (USA) in 2002. Like previous CP conferences, CP 2003 again showed the interdisciplinary nature of computing with constraints, and also its usefulness in many problem domains and applications. Constraint programming, with its solvers, languages, theoretical results, and applications, has become a widely recognized paradigm to model and solve successfully many real-life problems, and to reason about problems in many research areas.
Are there any lessons Romania can teach transitional justice scholars and practitioners? This book argues that important insights emerge when analyzing a country with a moderate record of coming to terms with its communist past. Taking a broad definition of transitional justice as their starting point, contributors provide fresh assessments of the history commission, court trials, public identifications of former communist perpetrators, commemorations, and unofficial artistic projects that seek to address and redress the legacies of communist human rights violations. Theoretical and practical questions regarding the continuity of state agencies, the sequencing of initiatives, their advantages and limitations, the reasons why some reckoning programs are enacted and others are not, and these measures’ efficacy in promoting truth and justice are answered throughout the volume. Contributors include seasoned scholars from Romania, Canada, the United States, and the United Kingdom, and current and former leaders of key Romanian transitional justice institutions.
For many decades, the Holocaust in South-Eastern Europe lacked the required introspection, research and study, and most importantly, access to archives and documentation. Only in recent years and with the significant help of an emerging generation of local scholars, the Holocaust from this region became the focus of many studies. In 2018, under the European Holocaust Research Infrastructure umbrella, the Elie Wiesel National Institute for the Study of the Holocaust in Romania organized a workshop dedicated to Holocaust research, education and remembrance in South-Eastern Europe. The present volume is a natural continuation of the above-mentioned workshop with the aim of introducing the current state of Holocaust research in the region to different categories of scholars in the field of Holocaust studies, to students and—why not—to the general public. Our scope, not an exhaustive one, is to present a historical contextualization using archival resources, to display the variety of recordings of discrimination, destruction and rescue efforts, and to introduce the remembrance initiatives and processes developed in the region in the aftermath of the Holocaust.
This book constitutes the refereed proceedings of the 16th International Symposium on Algorithms and Computation, ISAAC 2005, held in Sanya, Hainan, China in December 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.
This nine-volume set LNCS 14104 – 14112 constitutes the refereed workshop proceedings of the 23rd International Conference on Computational Science and Its Applications, ICCSA 2023, held at Athens, Greece, during July 3–6, 2023. The 350 full papers and 29 short papers and 2 PHD showcase papers included in this volume were carefully reviewed and selected from a total of 876 submissions. These nine-volumes includes the proceedings of the following workshops: Advances in Artificial Intelligence Learning Technologies: Blended Learning, STEM, Computational Thinking and Coding (AAILT 2023); Advanced Processes of Mathematics and Computing Models in Complex Computational Systems (ACMC 2023); Art...