Sciweavers

5244 search results - page 5 / 1049
» When are two algorithms the same
Sort
View
CEC
2008
IEEE
14 years 2 months ago
When to use bit-wise neutrality
—Representation techniques are important issues when designing successful evolutionary algorithms. Within this field the use of neutrality plays an important role. We examine th...
Tobias Friedrich, Frank Neumann
EVOW
2012
Springer
12 years 3 months ago
A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem
Abstract. We consider the two-echelon location-routing problem (2ELRP), a well-known problem in freight distribution arising when establishing a two-level transport system with lim...
Martin Schwengerer, Sandro Pirkwieser, Günthe...
CORR
2010
Springer
120views Education» more  CORR 2010»
13 years 5 months ago
When Feedback Doubles the Prelog in AWGN Networks
We demonstrate that the sum-rate capacity of a memoryless Gaussian network at high signal-to-signal ratio (SNR) can be asymptotically doubled when feedback is available. To demonst...
Michael Gastpar, Amos Lapidoth, Michele A. Wigger
SYNASC
2005
IEEE
86views Algorithms» more  SYNASC 2005»
14 years 1 months ago
One and Two Polarizations, Membrane Creation and Objects Complexity in P Systems
We improve, by using register machines, some existing universality results for specific models of P systems. P systems with membrane creation are known to generate all recursivel...
Artiom Alhazov, Rudolf Freund, Agustin Riscos-N&ua...
DALT
2006
Springer
13 years 11 months ago
When Agents Communicate Hypotheses in Critical Situations
This paper discusses the problem of efficient propagation of uncertain information in dynamic environments and critical situations. When a number of (distributed) agents have only ...
Gauvain Bourgne, Nicolas Maudet, Suzanne Pinson