16404 search results - page 336 / 3281 » A set coverage problem |
158
click to vote
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
15 years 5 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
164
click to vote
ADCM
2007
15 years 5 months ago
2007
In this paper we provide an extension of barycentric coordinates from simplices to arbitrary convex sets. Barycentric coordinates over convex 2D polygons have found numerous appli...
117
click to vote
TKDE
2008
15 years 4 months ago
2008
The computational grid is rapidly evolving into a service-oriented computing infrastructure that facilitates resource sharing and large-scale problem solving over the Internet. Ser...
164
click to vote
JPDC
2007
15 years 4 months ago
2007
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
154
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
In this paper we consider three di erent kinds of domain dependent control knowledge (temporal, procedural and HTN-based) that are useful in planning. Our approach is declarative ...