5169 search results - page 89 / 1034 » Locality approximation using time |
109
click to vote
EOR
2006
15 years 2 months ago
2006
In this paper, we present a stochastic model for the dynamic fleet management problem with random travel times. Our approach decomposes the problem into time-staged subproblems by...
102
Voted
NIPS
2007
15 years 4 months ago
2007
Machine learning techniques are increasingly being used to produce a wide-range of classifiers for complex real-world applications that involve nonuniform testing costs and miscl...
100
Voted
ASPDAC
1999
ACM
15 years 6 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
118
Voted
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the r...
121
Voted
IJAR
2008
15 years 2 months ago
2008
This paper reviews probabilistic approaches to rough sets in granulation, approximation, and rule induction. The Shannon entropy function is used to quantitatively characterize pa...