359 search results - page 8 / 72 » Solving Geometric Covering Problems by Data Reduction |
JCO
2010
13 years 6 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
AIR
2006
13 years 7 months ago
2006
Abstract We describe an instance-based reasoning solution to a variety of spatial reasoning problems. The solution centers on identifying an isomorphic mapping between labelled gra...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
role assignment is a programming abstraction that supports the assignment of user-defined roles to sensor nodes such that certain conditions are met. Many common network configu...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
BMCBI
2006
13 years 7 months ago
2006
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...