Sciweavers

949 search results - page 91 / 190
» Programmed Mutagenesis Is Universal
Sort
View
CHI
2009
ACM
16 years 5 months ago
The accidental tutor: overlaying an intelligent tutor on an existing user interface
Intelligent Tutoring Systems (ITSs) have been shown to have dramatic impact on student learning [9]. However, these gains have been mostly in topics in which the interface has bee...
Liz Blankenship, Stephen B. Gilbert, Stephen Bless...
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
15 years 8 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
15 years 5 months ago
Towards a theory of cache-efficient algorithms
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
Sandeep Sen, Siddhartha Chatterjee
ORL
1998
68views more  ORL 1998»
15 years 4 months ago
A fast bipartite network flow algorithm for selective assembly
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick
FROCOS
2009
Springer
15 years 11 months ago
Combining Nonmonotonic Knowledge Bases with External Sources
The developments in information technology during the last decade have been rapidly changing the possibilities for data and knowledge access. To respect this, several declarative k...
Thomas Eiter, Gerhard Brewka, Minh Dao-Tran, Micha...