10608 search results - page 618 / 2122 » Complexity of O'Hara's Algorithm |
188
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
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...
185
click to vote
ICGI
2010
Springer
15 years 8 months ago
2010
Springer
In this work, we give an algorithm that infers Regular Trace Languages. Trace languages can be seen as regular languages that are closed under a partial commutation relation called...
186
click to vote
ALGORITHMICA
2010
15 years 7 months ago
2010
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
156
click to vote
COMCOM
2008
15 years 7 months ago
2008
The primary focus of this paper is the design of efficient algorithm for the calculation of solution to the placement of proxies for performance optimization in hierarchical relia...
198
click to vote
DC
2006
15 years 7 months ago
2006
We consider the problem of how to schedule t similar and independent tasks to be performed in a synchronous distributed system of p stations communicating via multiple-access chan...