Sciweavers

530 search results - page 24 / 106
» Learning Bounds for Domain Adaptation
Sort
View
EMNLP
2010
13 years 8 months ago
Efficient Graph-Based Semi-Supervised Learning of Structured Tagging Models
We describe a new scalable algorithm for semi-supervised training of conditional random fields (CRF) and its application to partof-speech (POS) tagging. The algorithm uses a simil...
Amarnag Subramanya, Slav Petrov, Fernando Pereira
ECAI
2006
Springer
14 years 1 months ago
An Automated Agent for Bilateral Negotiation with Bounded Rational Agents with Incomplete Information
Many day-to-day tasks require negotiation, mostly under conditions of incomplete information. In particular, the opponent's exact tradeoff between different offers is usually ...
Raz Lin, Sarit Kraus, Jonathan Wilkenfeld, James B...
LWA
2007
13 years 11 months ago
Taking the Teacher's Perspective for User Modeling in Complex Domains
Serious games that should adapt training to the individual might benefit from methods that are developed for intelligent tutoring systems. One method, model tracing, might be used...
Christian P. Janssen, Hedderik van Rijn
ICALT
2003
IEEE
14 years 3 months ago
An Instructional Framework Supporting Personalized Learning on the Web
In this paper an instructional framework is proposed for supporting personalised learning in the context of webbased adaptive educational hypermedia systems. A learning-focused ap...
Kyparisia A. Papanikolaou, Maria Grigoriadou
ANOR
2008
171views more  ANOR 2008»
13 years 10 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet