Wyniki wyszukiwania:

Presents the proceedings of a conference which focused on topics in the design and analysis of algorithms, computational complexity and the theory of computation, including automata and formal languages, computational geometry, data structures and parallel/distributed computing.

This volume contains the proceedings of the 14th Annual International S- posium on Algorithms and Computation (ISAAC 2003), held in Kyoto, Japan, 15 17 December 2003. In the past, it was held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore (1997), Taejon (1998), Chennai (1999), Taipei (2000), Christchurch (2001), and Vancouver (2002). ISAACisanannualinternationalsymposiumthatcoverstheverywiderange of topics in algorithms and computation. The main purpose of the symposium is to provide a forum for researchers working in...

Our globalized world brings us increasing complexity and many computationally hard problems. Metaheuristics are mathematical optimization methods that have become a powerful answer to many of these difficult problems. As a growing set of robust methods, Metaheuristics is producing effective algorithms that compute approximate solutions of high quality in realistic computational time.

METAHEURISTICS: Progress as Real Problem Solvers is a peer-reviewed volume of eighteen current, cutting-edge papers by leading researchers in the field. Included are an invited paper by...

Our globalized world brings us increasing complexity and many computationally hard problems. Metaheuristics are mathematical optimization methods that have become a powerful answer to many of these difficult problems. As a growing set of robust methods, Metaheuristics is producing effective algorithms that compute approximate solutions of high quality in realistic computational time.

METAHEURISTICS: Progress as Real Problem Solvers is a peer-reviewed volume of eighteen current, cutting-edge papers by leading researchers in the field. Included are an invited paper by...

Algorithmic Aspects of Graph Connectivity is the first comprehensive book on this central notion in graph and network theory, emphasizing its algorithmic aspects. Because of its wide applications in the fields of communication, transportation, and production, graph connectivity has made tremendous algorithmic progress under the influence of the theory of complexity and algorithms in modern computer science. The book contains various definitions of connectivity, including edge-connectivity and vertex-connectivity, and their ramifications, as well as related topics such as flows and cuts. The...

This is the proceedings of the SIGAL International Symposium on Algorithms held at CSK Information Education Center, Tokyo, Japan, August 16-18, 1990. SIGAL (Special Interest Group on Algorithms) was organized within the Information Processing Society of Japan in 1988 to encourage research in the field of discrete algorithms, and held 6-8 research meetings each year.