Sciweavers

16 search results - page 2 / 4
» Partially ordered knapsack and applications to scheduling
Sort
View
JPDC
2006
85views more  JPDC 2006»
13 years 5 months ago
Provable algorithms for parallel generalized sweep scheduling
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...
CAISE
2000
Springer
13 years 9 months ago
Temporally Faithful Execution of Business Transactions
Serializability is a prominent correctness criterion for an interleaved execution of concurrent transactions. Serializability guarantees that the interleaved execution of concurre...
Werner Obermair, Michael Schrefl
ECRTS
2008
IEEE
13 years 11 months ago
Temporal Analysis for Adapting Concurrent Applications to Embedded Systems
Embedded services and applications that interact with the real world often, over time, need to run on different kinds of hardware (low-cost microcontrollers to powerful multicore ...
Sibin Mohan, Johannes Helander
ICTAI
1996
IEEE
13 years 9 months ago
Forward-Tracking: A Technique for Searching Beyond Failure
In many applications, such as decision support, negotiation, planning, scheduling, etc., one needs to express requirements that can only be partially satisfied. In order to expres...
Elena Marchiori, Massimo Marchiori, Joost N. Kok
CDC
2008
IEEE
204views Control Systems» more  CDC 2008»
13 years 11 months ago
Dynamic ping optimization for surveillance in multistatic sonar buoy networks with energy constraints
— In this paper we study the problem of dynamic optimization of ping schedule in an active sonar buoy network deployed to provide persistent surveillance of a littoral area throu...
Anshu Saksena, I-Jeng Wang