16404 search results - page 510 / 3281 » A set coverage problem |
167
click to vote
CEC
2009
IEEE
15 years 11 months ago
2009
IEEE
— Many real-world dynamic optimisation problems have constraints, and in certain cases not only the objective function changes over time, but the constraints also change as well....
159
click to vote
SC
1994
ACM
15 years 11 months ago
1994
ACM
In adaptive irregular problems the data arrays are accessed via indirection arrays, and data access patterns change during computation. Implementingsuch problems ondistributed mem...
190
click to vote
CPAIOR
2004
Springer
15 years 10 months ago
2004
Springer
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
168
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
178
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
The stable marriage problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more generally to...