3049 search results - page 281 / 610 » On the Convergence of Bound Optimization Algorithms |
198
Voted
STACS
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
178
Voted
COMCOM
2004
15 years 6 months ago
2004
The worst-case fairness index (WFI) has proved to be an important metric in the provision of fairness and bounded delay in both wired and wireless networks. A feature of wireless l...
192
click to vote
ICCV
2009
IEEE
15 years 4 months ago
2009
IEEE
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...
165
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
: The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints....
180
click to vote
DCOSS
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...