Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen [1]	Hilfe

Suche: Series=LNCS AND Volume=1337

• Discrete time analysis of a state dependent tandem with different customer types
  Hans Daduna
  Lecture Notes in Computer Science 1337, 1997, pp. 287-296
• How distributed algorithms play the token game
  Jörg Desel
  Lecture Notes in Computer Science 1337, 1997, pp. 297-306
• The asynchronous stack revisited: Rounds set the twilight reeling
  Rolf Walter
  Lecture Notes in Computer Science 1337, 1997, pp. 307-312
• Online scheduling of continuous media streams
  B. Monien, P. Berenbrink, R. Lüling, M. Riedel
  Lecture Notes in Computer Science 1337, 1997, pp. 313-320
• Contribution to goodenough's and Gerhart's theory of software testing and verification: Relation between strong compiler test and compiler implementation verification
  Hans Langmaack
  Lecture Notes in Computer Science 1337, 1997, pp. 321-335
• On the arrangement complexity of uniform trees
  Günter Hotz, Hongzhong Wu
  Lecture Notes in Computer Science 1337, 1997, pp. 337-350
• A relational-functional integration for declarative programming
  Harold Boley
  Lecture Notes in Computer Science 1337, 1997, pp. 351-358
• Inside and outside the Chinese room
  Siegfried Kanngiess̈er
  Lecture Notes in Computer Science 1337, 1997, pp. 359-368
• Abstract structures in spatial cognition
  Christopher Habel, Carola Eschenbach
  Lecture Notes in Computer Science 1337, 1997, pp. 369-378
• Spatial and temporal structures in cognitive processes
  Christian Freksa
  Lecture Notes in Computer Science 1337, 1997, pp. 379-387
• Qualitative vs. fuzzy representations of spatial distance
  Daniel Hernández
  Lecture Notes in Computer Science 1337, 1997, pp. 389-398
• What's a part? On formalizing part-whole relations
  Simone Pribbenow
  Lecture Notes in Computer Science 1337, 1997, pp. 399-406
• SPOCK: A feasibility study on the completeness of parts lists
  Claus R. Rollinger
  Lecture Notes in Computer Science 1337, 1997, pp. 407-415
• Decision support systems with adaptive reasoning strategies
  Kerstin Schill
  Lecture Notes in Computer Science 1337, 1997, pp. 417-427
• Knowledge discovery in databases - An inductive logic programming approach
  Katharina Morik
  Lecture Notes in Computer Science 1337, 1997, pp. 429-436
• The composition heuristic
  Kurt Ammon
  Lecture Notes in Computer Science 1337, 1997, pp. 437-444
• The job assignment problem: A study in parallel and distributed machine learning
  Gerhard Weiss̈
  Lecture Notes in Computer Science 1337, 1997, pp. 445-454
• Self-improving behavior arbitration
  Mohamed Salah Hamdi, Karl Kaiser
  Lecture Notes in Computer Science 1337, 1997, pp. 455-464
• Neural networks for manipulator path planning
  Margit Sturm
  Lecture Notes in Computer Science 1337, 1997, pp. 465-472
• Path planning using a subgoal graph
  Martin Eldracher, Thomas Pic
  Lecture Notes in Computer Science 1337, 1997, pp. 473-480
• A nonlinear Markovian characterization of time series using neural networks
  Christian Schittenkopf, Gustavo Deco
  Lecture Notes in Computer Science 1337, 1997, pp. 481-488
• Featur-based perception of semantic concepts
  Gabriele Scheler
  Lecture Notes in Computer Science 1337, 1997, pp. 489-497
• Automatic detection of thesaurus relations for information retrieval applications
  Gerda Ruge
  Lecture Notes in Computer Science 1337, 1997, pp. 499-506
• InfoSphere^{TM}-V: A new approach to 3D-visualization of information
  Leo Pfefferer, Dieter Schütt
  Lecture Notes in Computer Science 1337, 1997, pp. 507-514