Sciweavers

348 search results - page 37 / 70
» Using Case-Based Reasoning to Write Constraint Programs
Sort
View
CP
2009
Springer
16 years 7 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný
ICCBR
2001
Springer
15 years 11 months ago
Mining High-Quality Cases for Hypertext Prediction and Prefetching
Case-based reasoning aims to use past experience to solve new problems. A strong requirement for its application is that extensive experience base exists that provides statisticall...
Qiang Yang, Ian Tian Yi Li, Henry Haining Zhang
CEC
2008
IEEE
16 years 1 months ago
EA-MP: An evolutionary algorithm for a mine planning problem
In this paper we introduce an evolutionary algorithm for solving a copper mine planning problem. In the last 10 years this realworld problem has been tackled using linear integer p...
María-Cristina Riff, Teddy Alfaro, Xavier B...
POPL
2012
ACM
14 years 2 months ago
Access permission contracts for scripting languages
The ideal software contract fully specifies the behavior of an operation. Often, in particular in the context of scripting languages, a full specification may be cumbersome to s...
Phillip Heidegger, Annette Bieniusa, Peter Thieman...
256
Voted
POPL
2005
ACM
16 years 7 months ago
Automated soundness proofs for dataflow analyses and transformations via local rules
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
Sorin Lerner, Todd D. Millstein, Erika Rice, Craig...