| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNICAMPANIAVAN00127263 |
|
|
Autore |
Tadaki, Kohtaro |
|
|
Titolo |
A Statistical Mechanical Interpretation of Algorithmic Information Theory / Kohtaro Tadaki |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Singapore, : Springer, 2019 |
|
|
|
|
|
|
|
Titolo uniforme |
A Statistical Mechanical Interpretation of Algorithmic Information Theory |
|
|
|
|
|
|
|
Descrizione fisica |
|
xi, 136 p. : ill. ; 24 cm |
|
|
|
|
|
|
Soggetti |
|
82-XX - Statistical mechanics, structure of matter [MSC 2020] |
94-XX - Information and communication theory, circuits [MSC 2020] |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
2. |
Record Nr. |
UNIORUON00148405 |
|
|
Titolo |
1987 International Symposium for prevention of nuclear war and elimination of nuclear weapons, common cause of peace & democratic forces / sponsored by Japanese Communist Party |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Tokyo, : Japan Press Service, 1987 |
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Descrizione fisica |
|
|
|
|
|
|
Classificazione |
|
|
|
|
|
|
Soggetti |
|
Sociologia - Giappone - Conseguenze nucleari |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
|
|
|
|
|
|
|
3. |
Record Nr. |
UNINA9910484229603321 |
|
|
Titolo |
Efficient approximation and online algorithms : recent progress on classical combinatorial optimization problems and new applications / / Evripidis Bampis, Klaus Jansen, Claire Kenyon (eds.) |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
New York, : Springer, 2006 |
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2006.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (VII, 349 p.) |
|
|
|
|
|
|
Collana |
|
Lecture notes in computer science, , 0302-9743 ; ; 3484 |
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
|
|
|
|
|
|
|
Altri autori (Persone) |
|
BampisEvripidis |
JansenKlaus |
KenyonClaire |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer algorithms |
Online algorithms |
Combinatorial optimization - Data processing |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
Contributed Talks -- On Approximation Algorithms for Data Mining Applications -- A Survey of Approximation Results for Local Search Algorithms -- Approximation Algorithms for Path Coloring in Trees -- Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow -- Independence and Coloring Problems on Intersection Graphs of Disks -- Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications -- A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines -- Approximating a Class of Classification Problems -- List Scheduling in Order of ?-Points on a Single Machine -- Approximation Algorithms for the k-Median Problem -- The Lovász-Local-Lemma and Scheduling. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
This book provides a good opportunity for computer science practitioners and researchers to get in sync with current state-of-the-art and future trends in the field of combinatorial optimization and online algorithms. Recent advances in this area are presented focusing on the design of efficient approximation and on-line algorithms. One central idea in the book is to use a linear program relaxation of the |
|
|
|
|
|
|
|
|
|
|
problem, randomization and rounding techniques. |
|
|
|
|
|
| |