Sciweavers

222 search results - page 32 / 45
» Symmetry and Search in a Network Design Problem
Sort
View
JAIR
2006
74views more  JAIR 2006»
15 years 1 months ago
Understanding Algorithm Performance on an Oversubscribed Scheduling Application
The best performing algorithms for a particular oversubscribed scheduling application, Air Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet...
Laura Barbulescu, Adele E. Howe, L. Darrell Whitle...
SPAA
2005
ACM
15 years 7 months ago
Dynamic page migration with stochastic requests
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
Marcin Bienkowski
140
Voted
HIPC
2007
Springer
15 years 5 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
ICRA
2002
IEEE
166views Robotics» more  ICRA 2002»
15 years 6 months ago
Real Time Visualization of Robot State with Mobile Virtual Reality
— With the deployment of large, distributed networks of cameras and other sensors, it is becoming necessary to also address the issue of how to effectively present the large vol...
Peter Amstutz, Andrew H. Fagg
134
Voted
ATAL
2008
Springer
15 years 3 months ago
On k-optimal distributed constraint optimization algorithms: new bounds and algorithms
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...
Emma Bowring, Jonathan P. Pearce, Christopher Port...