Sciweavers

4753 search results - page 425 / 951
» Natural Modelling of Interactive Applications
Sort
View
184
Voted
CP
2004
Springer
16 years 3 days ago
Constraint-Based Combinators for Local Search
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...
Pascal Van Hentenryck, Laurent Michel, Liyuan Liu
FLAIRS
2004
15 years 8 months ago
A Dialogue-Based Tutoring System for Beginning Programming
We present a preventive model of tutoring for novice programming derived from a human corpus and describe our intelligent tutoring system PROPL embodying that model. The system co...
H. Chad Lane, Kurt VanLehn
CORR
2010
Springer
101views Education» more  CORR 2010»
15 years 6 months ago
Computing the Least Fixed Point of Positive Polynomial Systems
We consider equation systems of the form X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where f1, . . . , fn are polynomials with positive real coefficients. In vector fo...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
ICALP
2011
Springer
14 years 10 months ago
Restoring Pure Equilibria to Weighted Congestion Games
Abstract. Congestion games model several interesting applications, including routing and network formation games, and also possess attractive theoretical properties, including the ...
Konstantinos Kollias, Tim Roughgarden
EACL
2009
ACL Anthology
16 years 7 months ago
Using Lexical and Relational Similarity to Classify Semantic Relations
Many methods are available for computing semantic similarity between individual words, but certain NLP tasks require the comparison of word pairs. This paper presents a kernel-bas...
Ann A. Copestake, Diarmuid Ó Séaghdh...