Sciweavers

77 search results - page 3 / 16
» Neumann problems with time singularities
Sort
View
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
13 years 11 months ago
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Frank Neumann, Ingo Wegener
PPSN
2010
Springer
13 years 3 months ago
More Effective Crossover Operators for the All-Pairs Shortest Path Problem
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
Benjamin Doerr, Daniel Johannsen, Timo Kötzin...
SIAMCO
2008
70views more  SIAMCO 2008»
13 years 6 months ago
Minimal Time Sequential Batch Reactors with Bounded and Impulse Controls for One or More Species
We consider the optimal control problem of feeding in minimal time a tank where several species compete for a single resource, with the objective being to reach a given level of th...
Pedro Gajardo, Héctor Ramírez Cabrer...
VLDB
2007
ACM
109views Database» more  VLDB 2007»
14 years 6 months ago
FluxCapacitor: Efficient Time-Travel Text Search
An increasing number of temporally versioned text collections is available today with Web archives being a prime example. Search on such collections, however, is often not satisfa...
Klaus Berberich, Srikanta J. Bedathur, Thomas Neum...
SIAMAM
2008
94views more  SIAMAM 2008»
13 years 6 months ago
Diffusion of Protein Receptors on a Cylindrical Dendritic Membrane with Partially Absorbing Traps
Abstract. We present a model of protein receptor trafficking within the membrane of a cylindrical dendrite containing small protrusions called spines. Spines are the locus of most ...
Paul C. Bressloff, Berton A. Earnshaw, Michael J. ...