1080 search results - page 134 / 216 » Problem dependent optimization (PDO) |
144
click to vote
VLDB
1998
ACM
15 years 8 months ago
1998
ACM
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
122
click to vote
EOR
2010
15 years 4 months ago
2010
Outer linearization methods for two-stage stochastic linear programs with recourse, such as the L-shaped algorithm, generally apply a single optimality cut on the nonlinear object...
165
click to vote
CN
2007
15 years 4 months ago
2007
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is known yet about its appropriateness for search i...
147
click to vote
ICIP
2007
IEEE
16 years 6 months ago
2007
IEEE
LVQ is a simple but powerful tool for vector quantization and can be viewed as a vector generalization of uniform scalar quantization. Like VQ, LVQ is able to take into account sp...
142
click to vote
DATE
2005
IEEE
15 years 10 months ago
2005
IEEE
Context-aware applications pose new challenges, including a need for new computational models, uncertainty management, and efficient optimization under uncertainty. Uncertainty c...