Sciweavers

339 search results - page 23 / 68
» Is the Euclidean algorithm optimal among its peers
Sort
View
PPSN
2004
Springer
14 years 2 months ago
SPEA2+: Improving the Performance of the Strength Pareto Evolutionary Algorithm 2
Multi-objective optimization methods are essential to resolve real-world problems as most involve several types of objects. Several multi-objective genetic algorithms have been pro...
Mifa Kim, Tomoyuki Hiroyasu, Mitsunori Miki, Shiny...
ATMOS
2010
162views Optimization» more  ATMOS 2010»
13 years 6 months ago
Heuristics for the Traveling Repairman Problem with Profits
In the traveling repairman problem with profits, a repairman (also known as the server) visits a subset of nodes in order to collect time-dependent profits. The objective consists...
Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits ...
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 8 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
ISAAC
2005
Springer
131views Algorithms» more  ISAAC 2005»
14 years 2 months ago
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
Xiao Zhou, Takao Nishizeki
JNW
2008
173views more  JNW 2008»
13 years 8 months ago
Dominating Set Theory based Semantic Overlay Networks for Efficient and Resilient Content Distribution
Recently overlay networks have emerged as an efficient and flexible method for content distribution. An overlay network is a network running on top of another network, usually the ...
J. Amutharaj, S. Radhakrishnan