367 search results - page 69 / 74 » A memetic algorithm for graph coloring |
ASPDAC
2005
ACM
14 years 1 months ago
2005
ACM
Abstract— The success of classical high level synthesis has been limited by the complexity of the applications it can handle, typically not large enough to necessitate the depart...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...
ECOOP
1997
Springer
13 years 11 months ago
1997
Springer
A type inclusion test is a procedure to decide whether two types are related by a given subtyping relationship. An efficient implementation of the type inclusion test plays an impo...
COMCOM
2008
13 years 6 months ago
2008
Collaboration between Field Generators, Readers and Tags generates the required functions in using radio frequency identification (RFID) for psychiatric patient localization. The ...