Sciweavers

4114 search results - page 33 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
CORR
2010
Springer
139views Education» more  CORR 2010»
15 years 4 months ago
Algorithmic Solutions for Several Offline Constrained Resource Processing and Data Transfer Multicriteria Optimization Problems
In this paper we present novel algorithmic solutions for several resource processing and data transfer multicriteria optimization problems. The results of most of the presented tec...
Mugurel Ionut Andreica, Nicolae Tapus
NIPS
2004
15 years 5 months ago
Triangle Fixing Algorithms for the Metric Nearness Problem
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp
IICAI
2003
15 years 5 months ago
A Hybrid Genetic Algorithm for Minimum Vertex Cover Problem
Minimum vertex cover problem (MVCP) is an NP-hard problem and it has numerous real life applications. This paper presents hybrid genetic algorithm (HGA) to solve MVCP efficiently. ...
Ketan Kotecha, Nilesh Gambhava
UAI
1998
15 years 5 months ago
Flexible Decomposition Algorithms for Weakly Coupled Markov Decision Problems
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...
Ronald Parr
COR
2008
118views more  COR 2008»
15 years 4 months ago
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguis...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...