Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
Recent years have seen dramatic and sustained growth in the amount of genomic data being generated, including in late 1999 the first complete sequence of a human chromosome. The c...
Kevin Bryson, Michael Luck, Mike Joy, David T. Jon...
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
The automatic construction of classi ers programs able to correctly classify data collected from the real world is one of the major problems in pattern recognition and in a wide ar...
Cosimo Anglano, Attilio Giordana, Giuseppe Lo Bell...
This paper describes the design of the Bus Timetabling System (BTS) we have developed for one of the largest privately held bus companies in the world. This Bus Company operates cl...