3204 search results - page 446 / 641 » The b-chromatic Number of a Graph |
149
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...
193
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...
155
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...
179
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...
203
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...