Sciweavers

14518 search results - page 198 / 2904
» Two Problems for Sophistication
Sort
View
ESANN
2007
14 years 7 days ago
Several ways to solve the MSO problem
The so called MSO-problem, – a simple superposition of two or more sinusoidal waves –, has recently been discussed as a benchmark problem for reservoir computing and was shown ...
Jochen J. Steil
IPCO
1993
98views Optimization» more  IPCO 1993»
14 years 3 days ago
A spectral approach to bandwidth and separator problems in graphs
Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The b...
Christoph Helmberg, Bojan Mohar, Svatopluk Poljak,...
AMC
2005
154views more  AMC 2005»
13 years 10 months ago
Solving Laplacian problems with boundary singularities: a comparison of a singular function boundary integral method with the p/
We solve a Laplacian problem over an L-shaped domain using a singular function boundary integral method as well as the p/hp finite element method. In the former method, the soluti...
Miltiades Elliotis, Georgios Georgiou, Christos Xe...
KES
2007
Springer
13 years 10 months ago
Experimental Analysis of the Aging Operator for Static and Dynamic Optimisation Problems
Abstract. This work presents an analysis of the static Aging operator for different evolutionary algorithms: two immunological algorithms (OptIA and Clonalg), a standard genetic a...
Mario Castrogiovanni, Giuseppe Nicosia, Rosario Ra...
NHM
2010
87views more  NHM 2010»
13 years 5 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...