Case-based reasoning
On the computation of local interchangeability in discrete constraint satisfaction problems
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Communications of the ACM
The Wasabi Personal Shopper: a case-based recommender system
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Building an agent-mediated electronic commerce system with decision analysis features
Decision Support Systems - Decision-making and E-commerce systems
Local search with constraint propagation and conflict-based heuristics
Artificial Intelligence
Applying Case-Based Reasoning to Autoclave Loading
IEEE Expert: Intelligent Systems and Their Applications
Product Configuration Frameworks-A Survey
IEEE Intelligent Systems
Sales Configuration in Business Processes
IEEE Intelligent Systems
IEEE Intelligent Systems
Adaptive Assistants for Customized E-Shopping
IEEE Intelligent Systems
Spatial composition using cases: IDIOM
ICCBR '95 Proceedings of the First International Conference on Case-Based Reasoning Research and Development
Combining case based and constraint based techniques in travel reservation systems
CAIA '95 Proceedings of the 11th Conference on Artificial Intelligence for Applications
An effective customization procedure with configurable standard models
Decision Support Systems
Case and constraint-based apartment construction project planning system: FASTrak-APT
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
| Hi-index | 0.00 |
In electronic catalogs, commodities like computers and electronic equipment are specified as standard models even though a variety of possible alternative specifications can exist as a combination of selected options; therefore, customized configurations are essential to support various customers with individual needs. So the problem here is the selection of a standard model and reconfiguration with this selected model. An issue is that requirements may be fulfilled by more than one standard model. To develop an algorithm that can find the near minimum price without causing unacceptable computation effort, we devised the Standard Model Selection and Modification (SMSM) Algorithm. To establish the SMSM Algorithm, we propose the Concurrent Local Propagation procedure complemented with pruning capability owing to the nature of standard models. The effective strategies for selection of seed variables and stopping rules are devised through comparative experiments.