867 search results - page 119 / 174 » The Generalized Maximum Coverage Problem |
ISSTA
2009
ACM
14 years 2 months ago
2009
ACM
Mixed concrete and symbolic execution is an important technique for finding and understanding software bugs, including securityrelevant ones. However, existing symbolic execution...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
CPM
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
IWCMC
2006
ACM
14 years 1 months ago
2006
ACM
Designing and planning of the switching, signaling and support network is a fairly complex process in cellular mobile network. In this paper, the problem of assigning cells to swi...