287 search results - page 9 / 58 » Exact Cover with light |
117
click to vote
IPPS
2006
IEEE
15 years 9 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...
113
click to vote
DM
2008
15 years 3 months ago
2008
A clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a collection C of cliques such that each edge of G occurs in at least (exactly) one clique...
106
click to vote
COR
2007
15 years 3 months ago
2007
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
135
click to vote
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane, find a subset of discs to maximize the area covered by exactly on...
163
click to vote
CIAC
2006
Springer
15 years 7 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...