77 search results - page 15 / 16 » Large cycles in 4-connected graphs |
ISCA
1992
IEEE
13 years 10 months ago
1992
IEEE
A quantitative analysis of program execution is essential to the computer architecture design process. With the current trend in architecture of enhancing the performance of unipr...
IJCAI
2007
13 years 7 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
TSI
2008
13 years 5 months ago
2008
Ubiquitous applications are facing a large diversity of execution contexts. However, this diversity requires some continual adaptation to preserve the correct execution of these ap...
MOBICOM
2006
ACM
13 years 12 months ago
2006
ACM
Wireless sensor networks are tightly associated with the underlying environment in which the sensors are deployed. The global topology of the network is of great importance to bot...
SODA
1992
ACM
13 years 7 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...