1461 search results - page 190 / 293 » Complexity of Graph Covering Problems |
IEEEPACT
1998
IEEE
14 years 1 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
CAV
2008
Springer
13 years 11 months ago
2008
Springer
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
IPPS
2006
IEEE
14 years 3 months ago
2006
IEEE
Wireless mesh networks recently emerge as a flexible, low-cost and multipurpose networking platform with wired infrastructure connected to the Internet. A critical issue in mesh ...
ICALP
2000
Springer
14 years 16 days ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
Multiagent systems are often characterized by complex, and sometimes unpredictable interactions amongst their autonomous components. While these systems can provide robust and sca...