1515 search results - page 123 / 303 » Parallel computing on any desktop |
171
Voted
PDCAT
2005
Springer
15 years 9 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
167
click to vote
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...
130
click to vote
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
While lower supply voltage is effective for energy reduction, it suffers performance loss. To mitigate the loss, we propose to execute only the part, which does not have any influ...
117
Voted
ICPP
2003
IEEE
15 years 8 months ago
2003
IEEE
Strong mobility, which allows an external thread to transparently migrate an agent at any time, is difficult to implement in Java since the Java Virtual Machine does not allow se...
131
Voted
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
A delay-bounded service in wireless ad hoc networks is challenging, as ad hoc networks do not provide any type of guarantees. Several protocols have been proposed to support appli...