Sciweavers

73 search results - page 3 / 15
» Constraint Satisfaction Methods for Information Personalizat...
Sort
View
KCAP
2005
ACM
14 years 1 months ago
Knowledge base reuse through constraint relaxation
Effective reuse of Knowledge Bases (KBs) often entails the expensive task of identifying plausible KB-PS (Problem Solver) combinations. We propose a novel technique based on Const...
Tomas Eric Nordlander, Derek H. Sleeman, Ken N. Br...
GECCO
2004
Springer
284views Optimization» more  GECCO 2004»
14 years 25 days ago
Lagrange Multiplier Method for Multi-campaign Assignment Problem
It is crucial to maximize marketing efficiency and customer satisfaction in personalized marketing. In this paper, we raise the multiple recommendation problem which occurs when pe...
Yong-Hyuk Kim, Byung Ro Moon
DSS
2007
113views more  DSS 2007»
13 years 7 months ago
An associate constraint network approach to extract multi-lingual information for crime analysis
International crime and terrorism have drawn increasing attention in recent years. Retrieving relevant information from criminal records and suspect communications is important in...
Christopher C. Yang, Kar Wing Li
ECAI
2010
Springer
13 years 8 months ago
Restarts and Nogood Recording in Qualitative Constraint-based Reasoning
Abstract. This paper introduces restart and nogood recording techniques in the domain of qualitative spatial and temporal reasoning. Nogoods and restarts can be applied orthogonall...
Matthias Westphal, Stefan Wölfl, Jason Jingsh...
ATAL
2003
Springer
14 years 20 days ago
An asynchronous complete method for distributed constraint optimization
We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-a...
Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Mak...