2911 search results - page 364 / 583 » A Logic of Graph Constraints |
167
click to vote
WG
2004
Springer
15 years 12 months ago
2004
Springer
The clique problem consists in determining whether an undirected graph G of order n contains a clique of order . In this paper we are concerned with the decremental version of cliq...
165
click to vote
DATE
2003
IEEE
15 years 12 months ago
2003
IEEE
We present a high-level synthesis algorithm solving the combined scheduling, allocation and binding problem minimizing area under both latency and maximum power per clock-cycle co...
152
click to vote
SCAM
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper presents and evaluates a number of techniques to improve the execution time of interprocedural pointer analysis in the context of large C programs. The analysis is form...
158
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
The scheduling of application tasks is a problem that occurs in all multiprocessor systems. This problem becomes even more complicated if the tasks are not independent but are inte...
183
click to vote
COMPLEX
2009
Springer
15 years 10 months ago
2009
Springer
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...