Sciweavers

3644 search results - page 581 / 729
» Multi-torrent: a performance study and applications
Sort
View
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
13 years 10 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
APIN
2010
107views more  APIN 2010»
13 years 9 months ago
Extracting reduced logic programs from artificial neural networks
Artificial neural networks can be trained to perform excellently in many application areas. While they can learn from raw data to solve sophisticated recognition and analysis prob...
Jens Lehmann, Sebastian Bader, Pascal Hitzler
CGF
2010
135views more  CGF 2010»
13 years 9 months ago
Designing Quad-dominant Meshes with Planar Faces
We study the combined problem of approximating a surface by a quad mesh (or quad-dominant mesh) which on the one hand has planar faces, and which on the other hand is aestheticall...
Mirko Zadravec, Alexander Schiftner, Johannes Wall...
AUTOMATICA
2006
104views more  AUTOMATICA 2006»
13 years 9 months ago
Optimal sensor placement and motion coordination for target tracking
This work studies optimal sensor placement and motion coordination strategies for mobile sensor networks. For a target tracking application with range sensors, we investigate the ...
Sonia Martínez, Francesco Bullo
IANDC
2006
86views more  IANDC 2006»
13 years 9 months ago
Table design in dynamic programming
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
Peter Steffen, Robert Giegerich