Sciweavers

390 search results - page 15 / 78
» Set Intersection Theorems and Existence of Optimal Solutions
Sort
View
NOMS
2006
IEEE
14 years 1 months ago
An Enhanced Estimator to Multi-objective OSPF Weight Setting Problem
— Open Shortest Path First (OSPF) is a routing protocol which is widely used in the Industry. Its functionality mainly depends on the weights assigned to the links. Given the tra...
Mohammed H. Sqalli, Sadiq M. Sait, Mohammed Aijaz ...
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
13 years 8 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
AICCSA
2007
IEEE
124views Hardware» more  AICCSA 2007»
14 years 2 months ago
The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
Faisal N. Abu-Khzam, Nagiza F. Samatova, Mohamad A...
ICCV
2009
IEEE
15 years 20 days ago
Optimizing Parametric Total Variation Models
One of the key factors for the success of recent energy minimization methods is that they seek to compute global solutions. Even for non-convex energy functionals, optimization ...
Petter Strandmark, Fredrik Kahl, Niels Chr. Overga...
TEC
2008
88views more  TEC 2008»
13 years 7 months ago
A Simulated Annealing-Based Multiobjective Optimization Algorithm: AMOSA
This paper describes a simulated annealing based multiobjective optimization algorithm that incorporates the concept of archive in order to provide a set of tradeoff solutions for ...
Sanghamitra Bandyopadhyay, Sriparna Saha, Ujjwal M...