455 search results - page 55 / 91 » Approximation Algorithms for Partial Covering Problems |
75
Voted
WEBI
2004
Springer
15 years 3 months ago
2004
Springer
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
ICWS
2004
IEEE
14 years 11 months ago
2004
IEEE
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
92
Voted
INFOCOM
2012
IEEE
13 years 3 days ago
2012
IEEE
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
ICCAD
2001
IEEE
15 years 6 months ago
2001
IEEE
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. Certain devic...
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—We introduce Zen, a new resource allocation framework that assigns application components to node clusters to achieve high availability for partial-fault tolerant (PFT) applicat...