9119 search results - page 165 / 1824 » A Simultaneous Search Problem |
107
click to vote
CIMCA
2005
IEEE
15 years 6 months ago
2005
IEEE
Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. F...
112
Voted
HM
2007
Springer
15 years 5 months ago
2007
Springer
Optimization in sports is a field of increasing interest. A novel problem in sports management is the Referee Assignment Problem, in which a limited number of referees with differe...
130
Voted
COLOGNETWENTE
2010
14 years 10 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
107
Voted
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
113
Voted
FOCS
2006
IEEE
15 years 7 months ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...