566 search results - page 46 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
114
Voted
LICS
2006
IEEE
15 years 10 months ago
2006
IEEE
Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi. An importa...
116
click to vote
ACMICEC
2006
ACM
15 years 10 months ago
2006
ACM
In this paper we present a proposal for representing soft constraint satisfaction problems (CSPs) within the Semantic Web architecture. The proposal is motivated by the need for a...
124
click to vote
STACS
2009
Springer
15 years 11 months ago
2009
Springer
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve...
152
click to vote
CONSTRAINTS
2007
15 years 4 months ago
2007
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...
164
click to vote
ISDA
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--In business analysis, models are sometimes oversimplified. We pragmatically approach many problems with a single financial objective and include monetary values for non-m...