2542 search results - page 401 / 509 » Computing Cartograms with Optimal Complexity |
154
click to vote
SIGMETRICS
2006
ACM
16 years 5 days ago
2006
ACM
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
160
click to vote
CLUSTER
2005
IEEE
15 years 12 months ago
2005
IEEE
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...
148
click to vote
CODES
2005
IEEE
15 years 12 months ago
2005
IEEE
Networks-on-Chip (NoCs) have been recently proposed as a promising solution to complex on-chip communication problems. The lack of an unified representation of applications and ar...
144
click to vote
FOCS
2005
IEEE
15 years 12 months ago
2005
IEEE
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a wide variety of r...
158
click to vote
FOCS
2005
IEEE
15 years 12 months ago
2005
IEEE
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...