1629 search results - page 220 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
103
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
WISEC
2009
ACM
15 years 4 months ago
2009
ACM
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
CRYPTO
2006
Springer
15 years 1 months ago
2006
Springer
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
MOBIHOC
2005
ACM
15 years 9 months ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
SIGECOM
2003
ACM
15 years 3 months ago
2003
ACM
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...