Sciweavers

11565 search results - page 1943 / 2313
» Computing Minimal Mappings
Sort
View
KR
2004
Springer
16 years 6 days ago
An Improved Integer Local Search for Complex Scheduling Problems
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
Weixiong Zhang, Xiaotao Zhang
LCTRTS
2004
Springer
16 years 6 days ago
Procrastination scheduling in fixed priority real-time systems
Procrastination scheduling has gained importance for energy efficiency due to the rapid increase in the leakage power consumption. Under procrastination scheduling, task executio...
Ravindra Jejurikar, Rajesh K. Gupta
MFCS
2004
Springer
16 years 6 days ago
Optimal Preemptive Scheduling for General Target Functions
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
Leah Epstein, Tamir Tassa
NPC
2004
Springer
16 years 6 days ago
Lookup-Ring: Building Efficient Lookups for High Dynamic Peer-to-Peer Overlays
This paper is motivated by the problem of poor searching efficiency in decentralized peer-to-peer file-sharing systems. We solve the searching problem by considering and modeling t...
Xuezheng Liu, Guangwen Yang, Jinfeng Hu, Ming Chen...
SBIA
2004
Springer
16 years 6 days ago
Learning with Class Skews and Small Disjuncts
One of the main objectives of a Machine Learning – ML – system is to induce a classifier that minimizes classification errors. Two relevant topics in ML are the understanding...
Ronaldo C. Prati, Gustavo E. A. P. A. Batista, Mar...
« Prev « First page 1943 / 2313 Last » Next »