Sciweavers

8647 search results - page 517 / 1730
» The Container Selection Problem
Sort
View
ECAI
2000
Springer
15 years 11 months ago
A Framework for Dynamic Constraint Reasoning using Procedural Constraints
Many complex real-world decision problems, such as planning, contain an underlying constraint reasoning problem. The feasibility of a solution candidate then depends on the consis...
Ari K. Jónsson, Jeremy Frank
ICCBR
1999
Springer
15 years 11 months ago
When Experience Is Wrong: Examining CBR for Changing Tasks and Environments
Case-based problem-solving systems reason and learn from experiences, building up case libraries of problems and solutions to guide future reasoning. The expected bene ts of this l...
David B. Leake, David C. Wilson
NIPS
2003
15 years 8 months ago
Clustering with the Connectivity Kernel
Clustering aims at extracting hidden structure in dataset. While the problem of finding compact clusters has been widely studied in the literature, extracting arbitrarily formed ...
Bernd Fischer, Volker Roth, Joachim M. Buhmann
SIAMJO
2008
175views more  SIAMJO 2008»
15 years 6 months ago
On Bin Packing with Conflicts
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
Leah Epstein, Asaf Levin
CPAIOR
2010
Springer
15 years 5 months ago
Automatically Exploiting Subproblem Equivalence in Constraint Programming
Many search problems contain large amounts of redundancy in the search. In this paper we examine how to automatically exploit remaining subproblem equivalence, which arises when tw...
Geoffrey Chu, Maria Garcia de la Banda, Peter J. S...