210 search results - page 29 / 42 » Some Competition Programming Problems as the Beginning of Ar... |
152
Voted
AGP
1999
IEEE
15 years 8 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
150
Voted
AOR
2010
15 years 1 months ago
2010
Column generation algorithms have been specially designed for solving mathematical programs with a huge number of variables. Unfortunately, this method suffers from slow convergen...
150
Voted
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
Most of the software developed in the world follows the object-oriented (OO) paradigm. However, the existing work on evolutionary testing is mainly targeted to procedural language...
137
Voted
CP
2003
Springer
15 years 9 months ago
2003
Springer
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
136
click to vote
AIED
2005
Springer
15 years 9 months ago
2005
Springer
Intelligent Tutoring Systems are notoriously costly to construct [1], and require PhD level experience in cognitive science and rule based programming. The goal of this research wa...