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 YEAR=2005

• Identifying similar surface patches on proteins using a spin-image surface representation
  Mary Ellen Bock, Guido M. Cortelazzo, Carlo Ferrari, Concettina Guerra
  Lecture Notes in Computer Science 3537, 2005, pp. 417-428
• Mass spectra alignments and their significance
  Sebastian Böcker, Hans-Michael Kaltenbach
  Lecture Notes in Computer Science 3537, 2005, pp. 429-441
• The (true) concurrent Markov property and some applications to Markov nets
  Samy Abbes
  Lecture Notes in Computer Science 3536, 2005, pp. 70-89
• On the equivalence between liveness and deadlock-freeness in Petri nets
  Kamel Barkaoui, Jean-Michel Couvreur, Kais Klai
  Lecture Notes in Computer Science 3536, 2005, pp. 90-107
• Extremal throughputs in free-choice nets
  Anne Bouillard, Bruno Gaujal, Jean Mairesse
  Lecture Notes in Computer Science 3536, 2005, pp. 108-127
• A framework to decompose GSPN models
  Leonardo Brenner, Paulo Fernandes, Afonso Sales, Thais Webber
  Lecture Notes in Computer Science 3536, 2005, pp. 128-147
• Modeling dynamic architectures using nets-within-nets
  Lawrence Cabac, Michael Duvigneau, Daniel Moldt, Heiko Rölke
  Lecture Notes in Computer Science 3536, 2005, pp. 148-167
• A high level language for structural relations in well-formed nets
  Lorenzo Capra, Massimiliano De Pierro, Giuliana Franceschinis
  Lecture Notes in Computer Science 3536, 2005, pp. 168-187
• Derivation of non-structural invariants of Petri nets using abstract interpretation
  Robert Clarisó, Enric Rodríguez-Carbonell, Jordi Cortadella
  Lecture Notes in Computer Science 3536, 2005, pp. 188-207
• Modeling multi-valued genetic regulatory networks using high-level Petri nets
  Jean-Paul Comet, Hanna Klaudel, Stéphane Liauzu
  Lecture Notes in Computer Science 3536, 2005, pp. 208-227
• Improved approximation schemes for linear programming relaxations of combinatorial optimization problems
  Fabián A. Chudak, Vânia Eleutério
  Lecture Notes in Computer Science 3509, 2005, pp. 81-96
• On the approximability of the minimum congestion unsplittable shortest path routing problem
  Andreas Bley
  Lecture Notes in Computer Science 3509, 2005, pp. 97-110
• On the inefficiency of equilibria in congestion games
  José R. Correa, Andreas S. Schulz, Nicolás E. Stier-Moses
  Lecture Notes in Computer Science 3509, 2005, pp. 167-181
• LP-based online scheduling: From single to parallel machines
  José R. Correa, Michael R. Wagner
  Lecture Notes in Computer Science 3509, 2005, pp. 196-209
• Randomized relaxation methods for the maximum feasible subsystem problem
  Edoardo Amaldi, Pietro Belotti, Raphael Hauser
  Lecture Notes in Computer Science 3509, 2005, pp. 249-264
• On clique separators, nearly chordal graphs, and the maximum Weight Stable Set Problem
  Andreas Brandstädt, Chính T. Hoàng
  Lecture Notes in Computer Science 3509, 2005, pp. 265-275
• On two-stage stochastic minimum spanning trees
  Kedar Dhamdhere, R. Ravi, Mohit Singh
  Lecture Notes in Computer Science 3509, 2005, pp. 321-334
• Bidimensional packing by bilinear programming
  Alberto Caprara, Marco Locatelli, Michele Monaci
  Lecture Notes in Computer Science 3509, 2005, pp. 377-391
• Using grammars to generate very large scale neighborhoods for the Traveling Salesman Problem and other sequencing problems
  Agustin Bompadre, James B. Orlin
  Lecture Notes in Computer Science 3509, 2005, pp. 437-451
• A study of domino-parity and k-parity constraints for the TSP
  William Cook, Daniel Espinoza, Marcos Goycoolea
  Lecture Notes in Computer Science 3509, 2005, pp. 452-467
• An external partial permutations memory for ant colony optimization
  Adnan Acan
  Lecture Notes in Computer Science 3448, 2005, pp. 1-11
• A novel application of evolutionary computing in process systems engineering
  Jessica Andrea Carballido, Ignacio Ponzoni, Nélida Beatriz Brignole
  Lecture Notes in Computer Science 3448, 2005, pp. 12-22
• Choosing the fittest subset of low level heuristics in a hyperheuristic framework
  Konstantin Chakhlevitch, Peter Cowling
  Lecture Notes in Computer Science 3448, 2005, pp. 23-33
• An attribute grammar decoder for the 01 MultiConstrained knapsack problem
  Robert Cleary, Michael O'Neill
  Lecture Notes in Computer Science 3448, 2005, pp. 34-45
• EvoGeneS, a new evolutionary approach to graph generation
  Luigi Pietro Cordella, Claudio de Stefano, Francesco Fontanella, Angelo Marcelli
  Lecture Notes in Computer Science 3448, 2005, pp. 46-57