16404 search results - page 359 / 3281 » A set coverage problem |
140
Voted
ICCAD
1999
IEEE
15 years 9 months ago
1999
IEEE
We introduce the associative skew clock routing problem, which seeks a clock routing tree such that zero skew is preserved only within identified groups of sinks. The associative ...
156
click to vote
SODA
2000
ACM
15 years 6 months ago
2000
ACM
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...
124
click to vote
CEC
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper describes and analyzes the aggregation pheromone system (APS) algorithm, which extends ant colony optimization (ACO) to continuous domains. APS uses the collective behav...
139
Voted
SPIRE
2005
Springer
15 years 10 months ago
2005
Springer
Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U, conside...
125
click to vote
HM
2010
Springer
15 years 6 months ago
2010
Springer
The problem of designing workforce shifts and break patterns is a relevant employee scheduling problem that arises in many contexts, especially in service industries. The issue is ...