134 search results - page 10 / 27 » An Heuristic for the Construction of Intersection Graphs |
105
click to vote
COR
2000
14 years 11 months ago
2000
The multi-vehicle covering tour problem is de"ned on a graph G"(<6=, E), where = is a set of vertices that must collectively be covered by up to m vehicles. The probl...
STOC
2012
ACM
13 years 2 months ago
2012
ACM
In this work we describe an explicit, simple, construction of large subsets of Fn , where F is a finite field, that have small intersection with every k-dimensional affine subsp...
AGTIVE
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. With graph pattern matching the field of graph transformation (GT) includes an NP-complete subtask. But for real-life applications it is essential that graph pattern mat...
101
click to vote
CC
2006
Springer
15 years 3 months ago
2006
Springer
We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of d...
DCOSS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We present a distributed, localized and integrated approach for establishing both low-level (i.e. exploration of 1-hop neighbors, interference avoidance) and high-level (...