323 search results - page 62 / 65 » Exact Approximations of omega Numbers |
SDM
2009
SIAM
15 years 6 months ago
2009
SIAM
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. In t...
104
click to vote
CVPR
2009
IEEE
15 years 4 months ago
2009
IEEE
Illuminant estimation from shadows typically relies on accurate segmentation of the shadows and knowledge of exact 3D geometry, while shadow estimation is difficult in the presen...
WINE
2009
Springer
15 years 4 months ago
2009
Springer
We study convergence of ε-Nash dynamics in congestion games when delay functions of all resources are similar. Delay functions are said to be similar if their values are within a...
VLDB
2004
ACM
15 years 3 months ago
2004
ACM
Cost-based XML query optimization calls for accurate estimation of the selectivity of path expressions. Some other interactive and internet applications can also benefit from suc...
SIROCCO
2010
14 years 11 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...