Sciweavers

1963 search results - page 283 / 393
» The Maximum Solution Problem on Graphs
Sort
View
116
Voted
DAC
2011
ACM
14 years 13 days ago
Customer-aware task allocation and scheduling for multi-mode MPSoCs
Today’s multiprocessor system-on-a-chip (MPSoC) products typically have multiple execution modes, and for each mode, all the products utilize the same task allocation and schedu...
Lin Huang, Rong Ye, Qiang Xu
109
Voted
PODC
2009
ACM
15 years 7 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 4 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
96
Voted
EOR
2010
99views more  EOR 2010»
15 years 21 days ago
Min sum clustering with penalties
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
Refael Hassin, Einat Or
ICALP
2011
Springer
14 years 4 months ago
On Tree-Constrained Matchings and Generalizations
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...