680 search results - page 111 / 136 » Optimal spot-checking to minimize the computation time in vo... |
CP
2004
Springer
15 years 3 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
RECOMB
1997
Springer
15 years 1 months ago
1997
Springer
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
AIPS
2006
14 years 11 months ago
2006
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
WIOPT
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract— The ever-increasing popularity of web services, growing demand for wireless multimedia and introduction of new, feature-enhanced, hand-held devices has already given bi...
FOCS
2008
IEEE
14 years 10 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...