Respecting users' individual privacy constraints in web personalization
Web personalization has demonstrated to be advantageous for both online customers and
vendors. However, its benefits may be severely counter acted by privacy constraints …
vendors. However, its benefits may be severely counter acted by privacy constraints …
[PDF][PDF] Enabling Fast Flexible Planning through Incremental Temporal Reasoning with Conflict Extraction.
I Shu, RT Effinger, BC Williams - ICAPS, 2005 - cdn.aaai.org
In order for an autonomous agent to successfully complete its mission, the agent must be
able to quickly replan on the fly, as unforeseen events arise in the environment. This is …
able to quickly replan on the fly, as unforeseen events arise in the environment. This is …
Configuration
C Sinz, A Haag, N Narodytska, T Walsh… - IEEE Intelligent …, 2007 - ieeexplore.ieee.org
Over the years, a whole sector of AI dealing with configuration problems has emerged, and
since 1996, an annual configuration workshop has been held in affiliation with a major AI …
since 1996, an annual configuration workshop has been held in affiliation with a major AI …
Constraint satisfaction problem solver with interactive conflict resolution
CM Bagley, J Ng, G Chen - US Patent 8,751,425, 2014 - Google Patents
A solver solves constraint satisfaction problems. The solver receives a user decision and
propagates the user decision over a constraint satisfaction problem network. The solver then …
propagates the user decision over a constraint satisfaction problem network. The solver then …
[PDF][PDF] An introduction to solving interactive configuration problems
T Hadzic, HR Andersen - Techn. Ber. TR-2004-49, The IT University …, 2004 - academia.edu
Configuration problems emerged as a research topic in the late 1980s as the result of
manufacturing shift from mass-production to masscustomization. The essential part of a …
manufacturing shift from mass-production to masscustomization. The essential part of a …
Dynamic constraint satisfaction problem solver
M Colena, CM Bagley, G Chen - US Patent 8,504,501, 2013 - Google Patents
(57) ABSTRACT A system for Solving a dynamic constraint satisfaction prob lem comprises
a constraint network of variables and con straints. The system creates a first sub-problem …
a constraint network of variables and con straints. The system creates a first sub-problem …
Management of sub-problems in a dynamic constraint satisfaction problem solver
M Colena, G Chen - US Patent 8,065,255, 2011 - Google Patents
A solver solves a dynamic constraint satisfaction problem that is modeled as a constraint
network of variables and constraints. The solver generates a dynamic sub-problem facility …
network of variables and constraints. The solver generates a dynamic sub-problem facility …
Dynamic constraint satisfaction problem solver with inferred problem association removal
CM Bagley, G Chen, J Ng - US Patent 8,447,716, 2013 - Google Patents
A constraint solver for solving a constraint satisfaction problem network that comprises a
plurality of nodes and a plurality of constraints. The solver receives a request to remove an …
plurality of nodes and a plurality of constraints. The solver receives a request to remove an …
Constraint based system with domain splitting
CM Bagley, J Ng, G Chen, MP Plotkin - US Patent 8,229,870, 2012 - Google Patents
A solver for a constraint satisfaction problem includes a plurality of variables and a plurality
of constraints. A floating point variable has a domain and is assigned a value by first …
of constraints. A floating point variable has a domain and is assigned a value by first …
[PDF][PDF] Solver framework for conditional constraint satisfaction problems
Real world tasks with dynamic behavior, such as configuration, design, planning, or
hardware test generation, have been modeled with an extension of standard constraint …
hardware test generation, have been modeled with an extension of standard constraint …