3875 search results - page 695 / 775 » Approximation Algorithms for the Max-coloring Problem |
RTSS
2002
IEEE
14 years 19 days ago
2002
IEEE
In addition to real-time requirements, the program code size is a critical design factor for real-time embedded systems. To take advantage of the code size vs. execution time trad...
CAV
2001
Springer
14 years 6 days ago
2001
Springer
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...
SIGIR
1997
ACM
13 years 12 months ago
1997
ACM
Word usage is domain dependent. A common word in one domain can be quite infrequent in another. In this study we exploit this property of word usage to improve document routing. W...
ICFP
2007
ACM
14 years 7 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...