4843 search results - page 897 / 969 » The Shortcut Problem - Complexity and Approximation |
103
click to vote
ASPDAC
2001
ACM
15 years 1 months ago
2001
ACM
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...
KDD
2000
ACM
15 years 1 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
AIPS
2010
15 years 9 days ago
2010
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
HIS
2007
14 years 11 months ago
2007
This paper proposes a new approach for multicriteria optimization which aggregates the objective functions and uses a line search method in order to locate an approximate efficien...
UAI
2004
14 years 11 months ago
2004
Classical learning assumes the learner is given a labeled data sample, from which it learns a model. The field of Active Learning deals with the situation where the learner begins...