Sciweavers

2957 search results - page 544 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
WIESS
2000
13 years 9 months ago
Stub-Code Performance Is Becoming Important
As IPC mechanisms become faster, stub-code efficiency becomes a performance issue for local client/server RPCs and inter-component communication. Inefficient and unnecessary compl...
Andreas Haeberlen, Jochen Liedtke, Yoonho Park, La...
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
13 years 8 months ago
Evolutionary swarm design of architectural idea models
In this paper we present a swarm grammar system that makes use of bio-inspired mechanisms of reproduction, communication and construction in order to build three-dimensional struc...
Sebastian von Mammen, Christian Jacob
GG
2008
Springer
13 years 8 months ago
Transformation-Based Operationalization of Graph Languages
Graph Languages1 emerged during the seventies from the necessity to process data structures with complex interrelations. Nowadays, various variants of these languages can be found...
Erhard Weinell
BMCBI
2010
109views more  BMCBI 2010»
13 years 7 months ago
Prediction of the binding affinities of peptides to class II MHC using a regularized thermodynamic model
Background: The binding of peptide fragments of extracellular peptides to class II MHC is a crucial event in the adaptive immune response. Each MHC allotype generally binds a dist...
Andrew J. Bordner, Hans D. Mittelmann
BMCBI
2007
136views more  BMCBI 2007»
13 years 7 months ago
Reduced modeling of signal transduction - a modular approach
Background: Combinatorial complexity is a challenging problem in detailed and mechanistic mathematical modeling of signal transduction. This subject has been discussed intensively...
Markus Koschorreck, Holger Conzelmann, Sybille Ebe...