1952 search results - page 375 / 391 » Complete partitions of graphs |
103
click to vote
CGO
2006
IEEE
15 years 10 months ago
2006
IEEE
Explicit Data Graph Execution (EDGE) architectures offer the possibility of high instruction-level parallelism with energy efficiency. In EDGE architectures, the compiler breaks ...
162
click to vote
SIGECOM
2006
ACM
15 years 10 months ago
2006
ACM
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
136
click to vote
PODC
2005
ACM
15 years 9 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
152
click to vote
PLDI
2004
ACM
15 years 9 months ago
2004
ACM
Pointer analysis is a critical problem in optimizing compiler, parallelizing compiler, software engineering and most recently, hardware synthesis. While recent efforts have sugges...
121
click to vote
HICSS
2002
IEEE
15 years 9 months ago
2002
IEEE
As XML is gathering more and more importance in the field of data interchange in distributed business to business (B2B) applications, it is increasingly important to provide a for...