1629 search results - page 266 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
AAAI
2008
15 years 5 days ago
2008
Cooperative problem solving with resource constraints are important in practical multi-agent systems. Resource constraints are necessary to handle practical problems including dis...
102
click to vote
MOBICOM
2003
ACM
15 years 3 months ago
2003
ACM
Reducing the energy consumption by wireless communication devices is perhaps the most important issue in the widely-deployed and exponentially-growing IEEE 802.11 Wireless LANs (W...
SDM
2009
SIAM
15 years 7 months ago
2009
SIAM
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
MOBIHOC
2006
ACM
15 years 9 months ago
2006
ACM
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
111
click to vote
VLSID
2004
IEEE
15 years 10 months ago
2004
IEEE
demanding algorithm of a video encoder. It is known that about 60% ~ 80% of the total computation time is consumed for motion estimation [1]. The second is its high impact on the v...