1461 search results - page 233 / 293 » Complexity of Graph Covering Problems |
ISSTA
2009
ACM
14 years 3 months ago
2009
ACM
Traditional dynamic program slicing techniques are code-centric, meaning dependences are introduced between executed statement instances, which gives rise to various problems such...
SIGECOM
2009
ACM
14 years 3 months ago
2009
ACM
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
ICRA
2005
IEEE
14 years 2 months ago
2005
IEEE
Abstract— Landmark-based graphs are a useful and parsimonious tool for representing large scale environments. Relating landmarks by means of feedback-control algorithms encoded i...
SPAA
2005
ACM
14 years 2 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
WINET
2010
13 years 7 months ago
2010
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...