1647 search results - page 168 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
168
Voted
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
156
Voted
CONCUR
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
302
click to vote
ECAI
2010
Springer
15 years 6 months ago
2010
Springer
In the last decades enormous advances have been made possible for modelling complex (physical) systems by mathematical equations and computer algorithms. To deal with very long run...
160
Voted
ALGORITHMICA
2004
15 years 5 months ago
2004
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
143
click to vote
FOCS
1996
IEEE
15 years 9 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...