Sciweavers

339 search results - page 45 / 68
» Is the Euclidean algorithm optimal among its peers
Sort
View
JAIR
1998
195views more  JAIR 1998»
13 years 8 months ago
AntNet: Distributed Stigmergetic Control for Communications Networks
This paper introduces AntNet, a novel approach to the adaptive learning of routing tables in communications networks. AntNet is a distributed, mobile agents based Monte Carlo syst...
Gianni Di Caro, Marco Dorigo
HICSS
2003
IEEE
200views Biometrics» more  HICSS 2003»
14 years 2 months ago
A Dynamic Assignment Problem in a Mobile System with Limited Bandwidth
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
Yang Wang 0006, Thomas Kunz
CCGRID
2009
IEEE
14 years 3 months ago
Resource Allocation Using Virtual Clusters
— We propose a novel approach for sharing cluster resources among competing jobs. The key advantage of our approach over current solutions is that it increases cluster utilizatio...
Mark Stillwell, David Schanzenbach, Fréd&ea...
ICPP
1995
IEEE
14 years 7 days ago
Unicasting in Faulty Hypercubes Using Safety Levels
—We propose a unicasting algorithm for faulty hypercubes (including disconnected hypercubes) using the safety level concept. A faulty hypercube is a hypercube with faulty nodes a...
Jie Wu
GLOBECOM
2007
IEEE
14 years 3 months ago
Graph Theoretical Analysis of Opportunistic Scheduling Policy for Wireless Ad Hoc Networks
— 1 Taking advantage of the independent fading channel conditions among multiple wireless users, opportunistic transmissions schedule the user with the instantaneously best condi...
Qing Chen, Fei Ye, Zhisheng Niu