1257 search results - page 13 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
ANSS
2004
IEEE
15 years 1 months ago
2004
IEEE
The aim of the research is to investigate techniques that support efficient service scheduling algorithms in a service-oriented fault-tolerant real-time distributed system. Techni...
101
click to vote
ICC
2008
IEEE
15 years 4 months ago
2008
IEEE
— Designing switching architectures for network routers and switches needs to consider limits imposed by the electronic technology, like small bandwidth×distance factors, power ...
PDPTA
2004
14 years 11 months ago
2004
Current systems for managing workload on clusters of workstations, particularly those available for Linuxbased (Beowulf) clusters, are typically based on traditional process-based...
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
ML
2007
ACM
14 years 9 months ago
2007
ACM
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...