Sciweavers

379 search results - page 52 / 76
» Strong reducibility of partial numberings
Sort
View
IFL
2004
Springer
131views Formal Methods» more  IFL 2004»
14 years 3 months ago
Exploiting Single-Assignment Properties to Optimize Message-Passing Programs by Code Transformations
The message-passing paradigm is now widely accepted and used mainly for inter-process communication in distributed memory parallel systems. However, one of its disadvantages is the...
Alfredo Cristóbal-Salas, Andrey Chernykh, E...
ITS
2004
Springer
94views Multimedia» more  ITS 2004»
14 years 3 months ago
A Model for Student Knowledge Diagnosis Through Adaptive Testing
This work presents a model for student knowledge diagnosis that can be used in ITSs for student model update. The diagnosis is accomplished through Computerized Adaptive Testing (C...
Eduardo Guzmán, Ricardo Conejo
ISQED
2003
IEEE
134views Hardware» more  ISQED 2003»
14 years 3 months ago
Concurrent Fault Detection in Random Combinational Logic
We discuss a non-intrusive methodology for concurrent fault detection in random combinational logic. The proposed method is similar to duplication, wherein a replica of the circui...
Petros Drineas, Yiorgos Makris
ECML
2003
Springer
14 years 2 months ago
Pairwise Preference Learning and Ranking
We consider supervised learning of a ranking function, which is a mapping from instances to total orders over a set of labels (options). The training information consists of exampl...
Johannes Fürnkranz, Eyke Hüllermeier
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
14 years 2 months ago
Preemptive Online Scheduling with Reordering
We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a fixed size K > 0, which assists in partial reordering of...
György Dósa, Leah Epstein