3211 search results - page 471 / 643 » On the Grundy Number of a Graph |
139
click to vote
CAEPIA
2007
Springer
15 years 10 months ago
2007
Springer
Many recent successful planners use domain-independent heuristics to speed up the search for a valid plan. An orthogonal approach to accelerating search is to identify and remove r...
145
click to vote
ASPDAC
2004
ACM
15 years 10 months ago
2004
ACM
- Minimum area is one of the important objectives in technology mapping for lookup table-based FPGAs. It has been proven that the problem is NP-complete. This paper presents a poly...
187
click to vote
CASES
2004
ACM
15 years 10 months ago
2004
ACM
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. However, it is computationally expensive to automaticall...
147
click to vote
CAV
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We address the verification problem of programs manipulating oneselector linked data structures. We propose a new automated approach for checking safety and termination f...
172
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...