65 search results - page 11 / 13 » Two Polynomial Time Algorithms for the Metro-line Crossing M... |
DATE
2009
IEEE
14 years 3 months ago
2009
IEEE
— In this paper, we propose a novel, energy aware scheduling algorithm for applications running on DVS-enabled multiprocessor systems, which exploits variation in execution times...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
We study the problem of finding the least-priced path (LPP) between a source and a destination in opportunistic spectrum access (OSA) networks. This problem is motivated by econo...
COMPGEOM
2011
ACM
13 years 13 hour ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
ICSOC
2007
Springer
14 years 2 months ago
2007
Springer
Web services are rapidly emerging as a popular standard for sharing data and functionality among heterogeneous systems. We propose a general purpose Web Service Management System (...
AAIM
2007
Springer
14 years 2 months ago
2007
Springer
Packet scheduling in networks with quality of service constraints has been extensively studied as a single criterion scheduling problem. The assumption underlying single criterion ...