000 | 05306nam a22005655i 4500 | ||
---|---|---|---|
001 | 978-3-540-47849-2 | ||
003 | DE-He213 | ||
005 | 20160624102027.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1999 gw | s |||| 0|eng d | ||
020 |
_a9783540478492 _9978-3-540-47849-2 |
||
024 | 7 |
_a10.1007/3-540-47849-3 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUY _2bicssc |
|
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aCOM031000 _2bisacsh |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aSOFSEM’99: Theory and Practice of Informatics _h[electronic resource] : _b26th Conference on Current Trends in Theory and Practice of Informatics Milovy, Czech Republic, November 27 — December 4, 1999 Proceedings / _cedited by Jan Pavelka, Gerard Tel, Miroslav Bartošek. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1999. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1999. |
|
300 |
_aXIV, 506 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v1725 |
|
505 | 0 | _aInvited Talks -- Quantum Challenges -- Stability of Approximation Algorithms for Hard Optimization Problems -- Algorithms on Compressed Strings and Arrays -- WWW Based Collaboration with the BSCW System -- Middleware and Quality of Service -- Dynamic Reconfiguration of CORBA-Based Applications -- Fast, Error Correcting Parser Combinators: A Short Tutorial -- IBM SanFrancisco: Java Based Business Components, and New Tools to Develop Applications -- Databases and the World Wide Web -- Exploiting Formality in Software Engineering -- Biomolecular Computing and Programming -- Software Change and Evolution -- Distributed Simulation with Cellular Automata: Architecture and Applications -- Supporting Group-By and Pipelining in Bitmap-Enabled Query Processors -- On Interactive Computation: Intelligent Tutoring Systems -- Coherent Concepts, Robust Learning -- Application of Artificial Neural Networks for Different Engineering Problems -- Factor Oracle: A New Structure for Pattern Matching -- Principles of Forecasting — A Short Overview -- Contributed Papers -- UPV-Curry: An Incremental Curry Interpreter -- Quantum Finite Multitape Automata -- Decomposable Bulk Synchronous Parallel Computers -- Component Change and Version Identification in SOFA -- Pattern Equations and Equations with Stuttering -- Garbage Collection for Mobile and Replicated Objects -- Randomized Gossiping by Packets in Faulty Networks -- Object-Oriented Specification with the Parallel Multi-Label-Selective ?-calculus -- Simulation Problems for One-Counter Machine -- On Semantics of Petri Nets Over Partial Algebra -- Towards Possibilistic Decision Functions with Minimum-Based Sugeno Integrals -- Quantum Finite One-Counter Automata -- A Performance Comparison of Mobile Agents and RPC -- Cyclic Cutwidth of the Mesh -- Some Afterthoughts on Hopfield Networks -- A persistent-Set Approach to Abstract State-Space Construction in Verification -- Computational Power of Neuroidal Nets -- Cellular Automata with Dynamically Reconfigurable Buses. | |
520 | _aThis year the SOFSEM conference is coming back to Milovy in Moravia to th be held for the 26 time. Although born as a local Czechoslovak event 25 years ago SOFSEM did not miss the opportunity oe red in 1989 by the newly found freedom in our part of Europe and has evolved into a full-?edged international conference. For all the changes, however, it has kept its generalist and mul- disciplinarycharacter.Thetracksofinvitedtalks,rangingfromTrendsinTheory to Software and Information Engineering, attest to this. Apart from the topics mentioned above, SOFSEM’99 oer s invited talks exploring core technologies, talks tracing the path from data to knowledge, and those describing a wide variety of applications. TherichcollectionofinvitedtalkspresentsonetraditionalfacetofSOFSEM: that of a winter school, in which IT researchers and professionals get an opp- tunity to see more of the large pasture of today’s computing than just their favourite grazing corner. To facilitate this purpose the prominent researchers delivering invited talks usually start with a broad overview of the state of the art in a wider area and then gradually focus on their particular subject. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer Communication Networks. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aInformation theory. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aSoftware Engineering/Programming and Operating Systems. |
650 | 2 | 4 | _aComputer Communication Networks. |
650 | 2 | 4 | _aMathematics of Computing. |
700 | 1 |
_aPavelka, Jan. _eeditor. |
|
700 | 1 |
_aTel, Gerard. _eeditor. |
|
700 | 1 |
_aBartošek, Miroslav. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540666943 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v1725 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-47849-3 |
942 |
_2EBK6214 _cEBK |
||
999 |
_c35508 _d35508 |