681 search results - page 109 / 137 » General Polynomial Time Decomposition Algorithms |
DAC
2003
ACM
14 years 12 months ago
2003
ACM
To save energy, many power management policies rely on issuing mode-change commands to the components of the system. Efforts to date have focused on how these policies interact wi...
WWW
2007
ACM
14 years 11 months ago
2007
ACM
The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a...
INFOCOM
2009
IEEE
14 years 5 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
ICSOC
2007
Springer
14 years 5 months ago
2007
Springer
Web services are rapidly emerging as a popular standard for sharing data and functionality among heterogeneous systems. We propose a general purpose Web Service Management System (...
TACAS
2012
Springer
12 years 6 months ago
2012
Springer
Abstract. The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of...