Sciweavers

271 search results - page 19 / 55
» Equal To The Task
Sort
View
KDD
1995
ACM
135views Data Mining» more  KDD 1995»
13 years 11 months ago
Rough Sets Similarity-Based Learning from Databases
Manydata mining algorithms developed recently are based on inductive learning methods. Very few are based on similarity-based learning. However, similarity-based learning accrues ...
Xiaohua Hu, Nick Cercone
AI
1999
Springer
13 years 7 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
POPL
2011
ACM
12 years 10 months ago
Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol
We consider programs for embedded real-time systems which use priority-driven preemptive scheduling with task priorities adjusted dynamically according to the immediate ceiling pr...
Martin D. Schwarz, Helmut Seidl, Vesal Vojdani, Pe...
MIDDLEWARE
2007
Springer
14 years 1 months ago
Fair access to scarce resources in ad-hoc grids using an economic-based approach
In ad-hoc Grids where the availability of resources and tasks changes over the time, distributing the tasks among the scarce resources in a balanced way is a challenging task. In ...
Behnaz Pourebrahimi, Koen Bertels
SIGMETRICS
1998
ACM
13 years 11 months ago
Scheduling Policies to Support Distributed 3D Multimedia Applications
We consider the problem of scheduling tasks with unpredictable service times on distinct processing nodes so as to meet a real-time deadline, given that all communication among no...
Thu D. Nguyen, John Zahorjan