270 search results - page 28 / 54 » Programming with Intervals |
ICALP
1999
Springer
13 years 11 months ago
1999
Springer
The data sets for many of today's computer applications are too large to t within the computer's internal memory and must instead be stored on external storage devices su...
ALGORITHMICA
2010
13 years 7 months ago
2010
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
EOR
2007
13 years 7 months ago
2007
A multiple objective programming approach for the analytic network process (ANP) is proposed to obtain all local priorities for crisp or interval judgments at one time, even in an...
LCTRTS
2007
Springer
14 years 1 months ago
2007
Springer
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
CP
2005
Springer
14 years 28 days ago
2005
Springer
Classical methods for solving numerical CSPs are based on a branch and prune algorithm, a dichotomic enumeration process interleaved with a consistency filtering algorithm. In man...