Sciweavers

1113 search results - page 197 / 223
» Counter Systems for Data Logics
Sort
View
ITS
2004
Springer
130views Multimedia» more  ITS 2004»
15 years 5 months ago
Opening the Door to Non-programmers: Authoring Intelligent Tutor Behavior by Demonstration
Abstract. Intelligent tutoring systems are quite difficult and time intensive to develop. In this paper, we describe a method and set of software tools that ease the process of cog...
Kenneth R. Koedinger, Vincent Aleven, Neil T. Heff...
ICCS
2003
Springer
15 years 5 months ago
Generalization of the Fast Consistency Algorithm to a Grid with Multiple High Demand Zones
Abstract. One of the main challenges of grid systems of large scale and data intensive is that of providing high availability and performance, in spite of the unreliability and del...
Jesús Acosta-Elías, Leandro Navarro-...
DATE
2000
IEEE
88views Hardware» more  DATE 2000»
15 years 4 months ago
Techniques for Reducing Read Latency of Core Bus Wrappers
Today’s system-on-a-chip designs consist of many cores. To enable cores to be easily integrated into different systems, many propose creating cores with their internal logic sep...
Roman L. Lysecky, Frank Vahid, Tony Givargis
SIGSOFT
2000
ACM
15 years 4 months ago
Automated systematic testing for constraint-based interactive services
Constraint-based languages can express in a concise way the complex logic of a new generation of interactive services for applications such as banking or stock trading, that must ...
Patrice Godefroid, Lalita Jategaonkar Jagadeesan, ...
COLT
1999
Springer
15 years 4 months ago
On a Generalized Notion of Mistake Bounds
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
Sanjay Jain, Arun Sharma