Narrow your search

Library

Hogeschool West-Vlaanderen (2)

KU Leuven (2)

Odisee (2)

Thomas More Kempen (2)

Thomas More Mechelen (2)

UCLL (2)

ULB (2)

ULiège (2)

VIVES (2)

LUCA School of Arts (1)

More...

Resource type

book (2)


Language

English (2)


Year
From To Submit

2017 (1)

2010 (1)

Listing 1 - 2 of 2
Sort by

Book
Shocks, Singularities and Oscillations in Nonlinear Optics and Fluid Mechanics
Authors: --- --- --- ---
ISBN: 3319520423 3319520415 Year: 2017 Publisher: Cham : Springer International Publishing : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

The book collects the most relevant results from the INdAM Workshop "Shocks, Singularities and Oscillations in Nonlinear Optics and Fluid Mechanics" held in Rome, September 14-18, 2015. The contributions discuss recent major advances in the study of nonlinear hyperbolic systems, addressing general theoretical issues such as symmetrizability, singularities, low regularity or dispersive perturbations. It also investigates several physical phenomena where such systems are relevant, such as nonlinear optics, shock theory (stability, relaxation) and fluid mechanics (boundary layers, water waves, Euler equations, geophysical flows, etc.). It is a valuable resource for researchers in these fields. .


Book
Exact Exponential Algorithms
Authors: ---
ISBN: 364216532X 9786613567956 1280390034 3642165338 Year: 2010 Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Today most computer scientists believe that NP-hard problems cannot be solved by polynomial-time algorithms. From the polynomial-time perspective, all NP-complete problems are equivalent but their exponential-time properties vary widely. Why do some NP-hard problems appear to be easier than others? Are there algorithmic techniques for solving hard problems that are significantly faster than the exhaustive, brute-force methods? The algorithms that address these questions are known as exact exponential algorithms. The history of exact exponential algorithms for NP-hard problems dates back to the 1960s. The two classical examples are Bellman, Held and Karp’s dynamic programming algorithm for the traveling salesman problem and Ryser’s inclusion–exclusion formula for the permanent of a matrix. The design and analysis of exact algorithms leads to a better understanding of hard problems and initiates interesting new combinatorial and algorithmic challenges. The last decade has witnessed a rapid development of the area, with many new algorithmic techniques discovered. This has transformed  exact algorithms into a very active research field. This book provides an introduction to the area and explains the most common algorithmic techniques, and the text is supported throughout with exercises and detailed notes for further reading. The book is intended for advanced students and researchers in computer science, operations research, optimization and combinatorics.  .

Listing 1 - 2 of 2
Sort by