7006 search results - page 200 / 1402 » Approximation Algorithms |
147
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
138
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
We study constraint satisfaction problems on the domain {-1, 1}, where the given constraints are homogeneous linear threshold predicates. That is, predicates of the form sgn(w1x1 +...
114
click to vote
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We present a near-quadratic time algorithm that computes a point inside a simple polygon P having approximately the largest visibility polygon inside P, and a nearlinear time algo...
123
Voted
SOFSEM
2009
Springer
16 years 4 days ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
108
click to vote
AAAI
2006
15 years 4 months ago
2006
Active fusion is a process that purposively selects the most informative information from multiple sources as well as combines these information for achieving a reliable result ef...