Sciweavers

14548 search results - page 54 / 2910
» The Optimal Path-Matching Problem
Sort
View
DAGM
2003
Springer
14 years 3 months ago
Partial Optimal Labeling Search for a NP-Hard Subclass of (max, +) Problems
Optimal labeling problems are NP-hard in many practically important cases. Sufficient conditions for optimal label detection in every pixel are formulated. Knowing the values of th...
Ivan Kovtun
NHM
2010
73views more  NHM 2010»
13 years 4 months ago
The heterogeneous multiscale finite element method for advection-diffusion problems with rapidly oscillating coefficients and la
Abstract. This contribution is concerned with the formulation of a heterogeneous multiscale finite elements method (HMM) for solving linear advectiondiffusion problems with rapidly...
Patrick Henning, Mario Ohlberger
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
14 years 2 months ago
Solving quadratic assignment problems by genetic algorithms with GPU computation: a case study
Ì × Ô Ô Ö × Ö × × Ò Ò Ô Ö ÐÐ Ð Û Ø ÈÍ Óѹ ÔÙØ Ø ÓÒ ØÓ ×ÓÐÚ Ø ÕÙ Ö Ø ×× ÒÑ ÒØ ÔÖÓ Ð Ñ ´É ȵ Û × ÓÒ Ó Ø Ö ×Ø ÓÔØ ...
Shigeyoshi Tsutsui, Noriyuki Fujimoto
ATMOS
2007
13 years 11 months ago
Robust Algorithms and Price of Robustness in Shunting Problems
Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele ...
COR
2008
142views more  COR 2008»
13 years 9 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma