1989 search results - page 156 / 398 » cost 2010 |
186
click to vote
CP
2010
Springer
15 years 5 months ago
2010
Springer
Research on constraint propagation has primarily focused on designing polynomial-time propagators sometimes at the cost of a weaker filtering. Interestingly, the evolution of cons...
173
click to vote
EKAW
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Ontology reuse saves costs and improves interoperability between ontologies. Knowing which ontology to reuse is difficult without having a quality assessment. We employ u...
132
click to vote
ESWA
2010
15 years 5 months ago
2010
This study considers a relaxation of the truck and trailer routing problem (TTRP), called the relaxed truck and trailer routing problem (RTTRP). In the TTRP, the number of availab...
159
click to vote
IAJIT
2010
15 years 5 months ago
2010
: Warehouses scheduling is the problem of sequencing requests of products to fulfill several customers’ orders so as to minimize the average time and shipping costs. In this pape...
154
Voted
IANDC
2010
15 years 5 months ago
2010
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...