Sciweavers

4114 search results - page 5 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
JALC
2002
97views more  JALC 2002»
13 years 6 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri
IAJIT
2010
114views more  IAJIT 2010»
13 years 5 months ago
A Quantum-Inspired Differential Evolution Algorithm for Solving the N-Queens Problem
: In this paper, a quantum-inspired differential evolution algorithm for solving the N-queens problem is presented. The N-queens problem aims at placing N queens on an NxN chessboa...
Amer Draa, Souham Meshoul, Hichem Talbi, Mohamed B...
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 4 months ago
Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
Aleksander Madry
SIAMJO
2000
101views more  SIAMJO 2000»
13 years 6 months ago
An Efficient Algorithm for Minimizing a Sum of p-Norms
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
Guoliang Xue, Yinyu Ye
HIS
2009
13 years 4 months ago
A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
Bin Hu, Günther R. Raidl