Sciweavers

8825 search results - page 56 / 1765
» All for one or one for all
Sort
View
ITS
2004
Springer
165views Multimedia» more  ITS 2004»
14 years 1 months ago
Knowledge Representation Requirements for Intelligent Tutoring Systems
In this paper, we make a first effort to define requirements for knowledge representation (KR) in an ITS. The requirements concern all stages of an ITS’s life cycle (construction...
Ioannis Hatzilygeroudis, Jim Prentzas
DATE
2002
IEEE
98views Hardware» more  DATE 2002»
14 years 20 days ago
A Test Design Method for Floating Gate Defects (FGD) in Analog Integrated Circuits
A unified approach to fault simulation for FGDs is introduced. Instead of a direct fault simulation, the proposed approach calculates indirectly from the simulator output the set...
Michael Pronath, Helmut E. Graeb, Kurt Antreich
ISAAC
1999
Springer
110views Algorithms» more  ISAAC 1999»
13 years 12 months ago
Online Routing in Triangulations
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorit...
Prosenjit Bose, Pat Morin
ETFA
2006
IEEE
13 years 11 months ago
Non-Schedulability Conditions for Off-line Scheduling of Real-Time Systems Subject to Precedence and Strict Periodicity Constrai
Classical off-line approaches based on preemption such as RM (Rate Monotonic), DM (Deadline Monotonic), EDF (Earliest Deadline First), LLF (Least Laxity First), etc, give schedula...
Patrick Meumeu Yomsi, Yves Sorel
COCO
2008
Springer
86views Algorithms» more  COCO 2008»
13 years 9 months ago
The Multiplicative Quantum Adversary
We present a new variant of the quantum adversary method. All adversary methods give lower bounds on the quantum query complexity of a function by bounding the change of a progres...
Robert Spalek