5105 search results - page 837 / 1021 » An algorithm to determine peer-reviewers |
170
click to vote
RSA
2002
15 years 6 months ago
2002
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
174
click to vote
SAC
2002
ACM
15 years 6 months ago
2002
ACM
We investigate the universal characteristics of the simulated time horizon of the basic conservative parallel algorithm when implemented on regular lattices. This technique [1, 2]...
184
click to vote
TCS
1998
15 years 6 months ago
1998
We introduce a new constraint domain, aggregation constraints, that is useful in database query languages, and in constraint logic programming languages that incorporate aggregate...
162
click to vote
SIGMETRICS
2002
ACM
15 years 6 months ago
2002
ACM
Network tomography is a process for inferring "internal" link-level delay and loss performance information based on end-to-end (edge) network measurements. These methods...
159
click to vote
SQJ
2002
15 years 6 months ago
2002
Acknowledging the intense requirement for low power operation in most portable computing systems, this paper introduces the notion of energy efficient software design and proposes ...