7006 search results - page 1347 / 1402 » Approximation Algorithms |
125
click to vote
TAMC
2009
Springer
15 years 5 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
103
Voted
INFOCOM
2000
IEEE
15 years 5 months ago
2000
IEEE
— While packet scheduling for wired links is a maturing area, scheduling of wireless links is less mature. A fundamental difference between wired and wireless links is that wirel...
RTSS
1999
IEEE
15 years 5 months ago
1999
IEEE
The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple Q...
113
click to vote
FCS
2007
15 years 2 months ago
2007
In many task-planning domains, dynamic assemblies of autonomous agents are replacing hierarchical organisations because they promise more agility. In such assemblies, interdepende...
114
Voted
JSAC
2006
15 years 19 days ago
2006
Abstract--In this paper, we consider a many-to-one sensor network where a large number of sensors are deployed to monitor a physical environment. We explore sensor activity managem...