Sciweavers

3051 search results - page 588 / 611
» Learning Internal Representations
Sort
View
FLAIRS
2006
15 years 1 months ago
Using Enhanced Concept Map for Student Modeling in Programming Tutors
We have been using the concept map of the domain, enhanced with pedagogical concepts called learning objectives, as the overlay student model in our intelligent tutors for program...
Amruth N. Kumar
AAAI
1994
15 years 1 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
ISMB
1994
15 years 1 months ago
Predicting Location and Structure Of beta-Sheet Regions Using Stochastic Tree Grammars
We describe and demonstrate the effectiveness of a method of predicting protein secondary structures, sheet regions in particular, using a class of stochastic tree grammars as rep...
Hiroshi Mamitsuka, Naoki Abe
WWW
2010
ACM
15 years 16 hour ago
Cross-domain sentiment classification via spectral feature alignment
Sentiment classification aims to automatically predict sentiment polarity (e.g., positive or negative) of users publishing sentiment data (e.g., reviews, blogs). Although traditio...
Sinno Jialin Pan, Xiaochuan Ni, Jian-Tao Sun, Qian...
GPEM
2008
128views more  GPEM 2008»
14 years 12 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood