Sciweavers

1984 search results - page 121 / 397
» The colourful feasibility problem
Sort
View
SCL
2011
13 years 5 months ago
Analysis of consensus protocols with bounded measurement errors
This paper analyzes two classes of consensus algorithms in presence of bounded measurement errors. The considered protocols adopt an updating rule based either on constant or vani...
Andrea Garulli, Antonio Giannitrapani
IPPS
2008
IEEE
14 years 4 months ago
NETEMBED: A network resource mapping service for distributed applications
Emerging configurable infrastructures (large-scale overlays, grids, distributed testbeds, and sensor networks among others) comprise diverse sets of computing resources and netwo...
Jorge Londoño, Azer Bestavros
EVOW
2005
Springer
14 years 3 months ago
Application of the Grouping Genetic Algorithm to University Course Timetabling
University Course Timetabling-Problems (UCTPs) involve the allocation of resources (such as rooms and timeslots) to all the events of a university, satisfying a set of hard-constra...
Rhydian Lewis, Ben Paechter
HYBRID
2005
Springer
14 years 3 months ago
Hybrid Decentralized Control of Large Scale Systems
Abstract. Motivated by three applications which are under investigation at the Honeywell Research Laboratory in Minneapolis, we introduce a class of large scale control problems. I...
Francesco Borrelli, Tamás Keviczky, Gary J....
DATE
2000
IEEE
85views Hardware» more  DATE 2000»
14 years 2 months ago
Meeting Delay Constraints in DSM by Minimal Repeater Insertion
We address the problem of inserting repeaters, selected from a library, at feasible locations in a placed and routed network to meet user-specified delay constraints. We use mini...
I-Min Liu, Adnan Aziz, D. F. Wong