Catálogo de publicaciones - libros
Remote Sensing of Sea Ice in the Northern Sea Route: Studies and Applications
Ola M. Johannessen Vitaly Yu. Alexandrov Ivan Ye. Frolov Stein Sandven Lasse H. Pettersson Leonid P. Bobylev Kjell Kloster Vladimir G. Smirnov Yevgeny U. Mironov Nikolay G. Babich
Resumen/Descripción – provisto por la editorial
No disponible.
Palabras clave – provistas por la editorial
Geophysics/Geodesy; Oceanography; Freshwater & Marine Ecology; Geoecology/Natural Processes
Disponibilidad
| Institución detectada | Año de publicación | Navegá | Descargá | Solicitá |
|---|---|---|---|---|
| No detectada | 2007 | SpringerLink |
Información
Tipo de recurso:
libros
ISBN impreso
978-3-540-24448-6
ISBN electrónico
978-3-540-48840-8
Editor responsable
Springer Nature
País de edición
Reino Unido
Fecha de publicación
2007
Información sobre derechos de publicación
© Praxis Publishing Ltd 2007
Cobertura temática
Tabla de contenidos
History of the Northern Sea Route
Ola M. Johannessen; Vitaly Yu. Alexandrov; Ivan Ye. Frolov; Stein Sandven; Lasse H. Pettersson; Leonid P. Bobylev; Kjell Kloster; Vladimir G. Smirnov; Yevgeny U. Mironov; Nikolay G. Babich
We give a deterministic algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its upper bound on the worst-case running time matches the best known upper bound for randomized satisfiability-testing algorithms [6]. In comparison with the randomized algorithm in [6], our deterministic algorithm is simpler and more intuitive.
Pp. 1-23
Sea-ice conditions in the Arctic and in the Northern Sea Route
Ola M. Johannessen; Vitaly Yu. Alexandrov; Ivan Ye. Frolov; Stein Sandven; Lasse H. Pettersson; Leonid P. Bobylev; Kjell Kloster; Vladimir G. Smirnov; Yevgeny U. Mironov; Nikolay G. Babich
We give a deterministic algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its upper bound on the worst-case running time matches the best known upper bound for randomized satisfiability-testing algorithms [6]. In comparison with the randomized algorithm in [6], our deterministic algorithm is simpler and more intuitive.
Pp. 25-64
Sea ice monitoring
Ola M. Johannessen; Vitaly Yu. Alexandrov; Ivan Ye. Frolov; Stein Sandven; Lasse H. Pettersson; Leonid P. Bobylev; Kjell Kloster; Vladimir G. Smirnov; Yevgeny U. Mironov; Nikolay G. Babich
We give a deterministic algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its upper bound on the worst-case running time matches the best known upper bound for randomized satisfiability-testing algorithms [6]. In comparison with the randomized algorithm in [6], our deterministic algorithm is simpler and more intuitive.
Pp. 65-148
Satellite remote sensing of sea ice
Ola M. Johannessen; Vitaly Yu. Alexandrov; Ivan Ye. Frolov; Stein Sandven; Lasse H. Pettersson; Leonid P. Bobylev; Kjell Kloster; Vladimir G. Smirnov; Yevgeny U. Mironov; Nikolay G. Babich
We give a deterministic algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its upper bound on the worst-case running time matches the best known upper bound for randomized satisfiability-testing algorithms [6]. In comparison with the randomized algorithm in [6], our deterministic algorithm is simpler and more intuitive.
Pp. 149-252
Sea ice conditions observed from satellite remote-sensing data
Ola M. Johannessen; Vitaly Yu. Alexandrov; Ivan Ye. Frolov; Stein Sandven; Lasse H. Pettersson; Leonid P. Bobylev; Kjell Kloster; Vladimir G. Smirnov; Yevgeny U. Mironov; Nikolay G. Babich
We give a deterministic algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its upper bound on the worst-case running time matches the best known upper bound for randomized satisfiability-testing algorithms [6]. In comparison with the randomized algorithm in [6], our deterministic algorithm is simpler and more intuitive.
Pp. 253-322
Application of SAR for ice navigation in the Northern Sea Route
Ola M. Johannessen; Vitaly Yu. Alexandrov; Ivan Ye. Frolov; Stein Sandven; Lasse H. Pettersson; Leonid P. Bobylev; Kjell Kloster; Vladimir G. Smirnov; Yevgeny U. Mironov; Nikolay G. Babich
We give a deterministic algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its upper bound on the worst-case running time matches the best known upper bound for randomized satisfiability-testing algorithms [6]. In comparison with the randomized algorithm in [6], our deterministic algorithm is simpler and more intuitive.
Pp. 323-396
Climatic variability of sea ice in the Arctic
Ola M. Johannessen; Vitaly Yu. Alexandrov; Ivan Ye. Frolov; Stein Sandven; Lasse H. Pettersson; Leonid P. Bobylev; Kjell Kloster; Vladimir G. Smirnov; Yevgeny U. Mironov; Nikolay G. Babich
We give a deterministic algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its upper bound on the worst-case running time matches the best known upper bound for randomized satisfiability-testing algorithms [6]. In comparison with the randomized algorithm in [6], our deterministic algorithm is simpler and more intuitive.
Pp. 397-422
Afterword
I. Ye. Frolov; V. Yu. Alexandrov; Ye. U. Mironov; A. G. Gorshkovsky; N. G. Babich; V. G. Smirnov
We give a deterministic algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its upper bound on the worst-case running time matches the best known upper bound for randomized satisfiability-testing algorithms [6]. In comparison with the randomized algorithm in [6], our deterministic algorithm is simpler and more intuitive.
Pp. 423-425