1632 search results - page 77 / 327 » Sublinear Time Algorithms for Metric Space Problems |
118
click to vote
BMCBI
2006
15 years 3 months ago
2006
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
134
click to vote
CEC
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...
111
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we set the first steps towards the development of a commercially viable tool that uses evolutionary computation to address the Product to Shelf Allocation Problem (P...
184
Voted
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
115
Voted
CCCG
2006
15 years 4 months ago
2006
Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of...