Sciweavers

4565 search results - page 185 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
INFOCOM
2005
IEEE
14 years 4 months ago
Optimal utility based multi-user throughput allocation subject to throughput constraints
— We consider the problem of scheduling multiple users sharing a time-varying wireless channel. (As an example, this is a model of scheduling in 3G wireless technologies, such as...
Matthew Andrews, Lijun Qian, Alexander L. Stolyar
TACAS
2010
Springer
342views Algorithms» more  TACAS 2010»
14 years 5 months ago
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
Janusz Malinowski, Peter Niebert
ICDM
2005
IEEE
147views Data Mining» more  ICDM 2005»
14 years 4 months ago
Partial Elastic Matching of Time Series
We consider the problem of elastic matching of time series. We propose an algorithm that determines a subsequence of a target time series that best matches a query series. In the ...
Longin Jan Latecki, Vasileios Megalooikonomou, Qia...
ECRTS
2007
IEEE
14 years 5 months ago
On Scheduling and Real-Time Capacity of Hexagonal Wireless Sensor Networks
Since wireless ad-hoc networks use shared communication medium, accesses to the medium must be coordinated to avoid packet collisions. Transmission scheduling algorithms allocate ...
Shashi Prabh, Tarek F. Abdelzaher
MOR
2000
90views more  MOR 2000»
13 years 10 months ago
A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
Martin Skutella, Gerhard J. Woeginger