Sciweavers

5860 search results - page 1043 / 1172
» Learning and Domain Adaptation
Sort
View
GECCO
2006
Springer
192views Optimization» more  GECCO 2006»
15 years 10 months ago
Optimising cancer chemotherapy using an estimation of distribution algorithm and genetic algorithms
This paper presents a methodology for using heuristic search methods to optimise cancer chemotherapy. Specifically, two evolutionary algorithms - Population Based Incremental Lear...
Andrei Petrovski, Siddhartha Shakya, John A. W. Mc...
EUROCRYPT
2000
Springer
15 years 10 months ago
Minimal-Latency Secure Function Evaluation
Sander, Young and Yung recently exhibited a protocol for computing on encrypted inputs, for functions computable in NC1 . In their variant of secure function evaluation, Bob (the &...
Donald Beaver
ITS
2000
Springer
94views Multimedia» more  ITS 2000»
15 years 10 months ago
DT Tutor: A Decision-Theoretic, Dynamic Approach for Optimal Selection of Tutorial Actions
DT Tutor uses a decision-theoretic approach to select tutorial actions for coached problem solving that are optimal given the tutor's beliefs and objectives. It employs a mode...
R. Charles Murray, Kurt VanLehn
ITS
2000
Springer
137views Multimedia» more  ITS 2000»
15 years 10 months ago
Design Principles for a System to Teach Problem Solving by Modelling
This paper presents an approach to the design of a learning environment in a mathematical domain (elementary combinatorics) where problem solving is based more on modelling than o...
Gérard Tisseau, Hélène Giroir...
ICCV
1995
IEEE
15 years 10 months ago
Object Indexing Using an Iconic Sparse Distributed Memory
A general-purpose object indexingtechnique is described that combines the virtues of principal component analysis with the favorable matching properties of high-dimensional spaces...
Rajesh P. N. Rao, Dana H. Ballard
« Prev « First page 1043 / 1172 Last » Next »