5448 search results - page 390 / 1090 » Breakpoints and Time in Distributed Computations |
159
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
198
click to vote
ICPP
1993
IEEE
15 years 11 months ago
1993
IEEE
Optimal load allocation for load sharing a divisible job over processors interconnected in either a bus or a tree network is considered. The processors are either equipped with fro...
157
click to vote
ICPP
1989
IEEE
15 years 10 months ago
1989
IEEE
Efficient hypercube algorithms are developed for the following image transformations: shrinking, expanding, translation, rotation, and scaling. A 2k −step shrinking and expandi...
204
click to vote
HPCC
2007
Springer
15 years 10 months ago
2007
Springer
In wireless sensor networks with many-to-one transmission mode, a multi-objective TDMA (Time Division Multiple Access) scheduling model is presented, which concerns about the packe...
177
click to vote
WIOPT
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--CSMA is the predominant distributed access protocol for wireless mesh networks. Originally designed for singlehop settings, in multi-hop networks CSMA can exhibit severe ...