348 search results - page 17 / 70 » Using Case-Based Reasoning to Write Constraint Programs |
113
click to vote
SIAMJO
2008
15 years 4 months ago
2008
This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...
159
click to vote
EWCBR
2008
Springer
15 years 6 months ago
2008
Springer
To meet time constraints, a CBR system must control the time spent searching in the case base for a solution. In this paper, we presents the results of a case study comparing the p...
131
click to vote
CC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. To reason about programs, dynamic optimizers and analysis tools use sampling to collect a dynamic call graph (DCG). However, sampling has not achieved high accuracy with ...
140
click to vote
LCPC
2007
Springer
15 years 10 months ago
2007
Springer
Recent studies have shown that programming in a Partition Global Address Space (PGAS) language can be more productive than programming in a message passing model. One reason for th...
123
click to vote
AI
2001
Springer
15 years 8 months ago
2001
Springer
A system's constraints characterizes what that system can do. However, a dynamic environment may require that a system alter its constraints. If feedback about a specific situ...