613 search results - page 67 / 123 » Generalized Traveling Salesman Problem Reduction Algorithms |
PLDI
2004
ACM
14 years 1 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called ret...
CP
2006
Springer
13 years 11 months ago
2006
Springer
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...