2107 search results - page 122 / 422 » Computing Small Search Numbers in Linear Time |
104
Voted
CIA
2006
Springer
15 years 7 months ago
2006
Springer
We present a mechanism for collaboration and coordination amongst agents in multi-agent societies seeking social equity. This mechanism allows to compute egalitarian allocations of...
139
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
112
click to vote
PATMOS
2004
Springer
15 years 8 months ago
2004
Springer
Synchronization between independently clocked regions in a high performance system is often subject to latencies of more than one clock cycle. We show how the latency can be reduce...
179
click to vote
CLUSTER
2011
IEEE
14 years 3 months ago
2011
IEEE
—Much of dense linear algebra has been successfully blocked to concentrate the majority of its time in the Level 3 BLAS, which are not only efficient for serial computation, but...
131
Voted
CSL
2004
Springer
15 years 9 months ago
2004
Springer
The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems, ¢¡ , comprised of finite, but arbitrarily many,...