3211 search results - page 443 / 643 » On the Grundy Number of a Graph |
175
click to vote
DATE
2004
IEEE
15 years 10 months ago
2004
IEEE
The growing use of digital signal processors (DSPs) in embedded systems necessitates the use of optimizing compilers supporting special hardware features. Due to the irregular arc...
147
click to vote
DATE
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper presents an exploration algorithm which examines execution time and energy consumption of a given application, while considering a parameterized memory architecture. Th...
155
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We address the problem of representing big sets of binary constraints compactly. Binary constraints in the form of 2literal clauses are ubiquitous in propositional formul...
190
click to vote
HT
1991
ACM
15 years 10 months ago
1991
ACM
Hypertext systems are being used in many applications because of their flexible structure and the great browsing freedom they give to diverse communities of users. However, this s...
171
click to vote
FOCS
1994
IEEE
15 years 10 months ago
1994
IEEE
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...