566 search results - page 26 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
93
Voted
AAAI
2007
15 years 2 months ago
2007
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
CDC
2009
IEEE
15 years 3 months ago
2009
IEEE
Abstract— This paper addresses a problem of finding an optimal dynamic quantizer for nonlinear control subject to discretevalued signal constraints. The quantizers to be studied...
94
Voted
WG
2004
Springer
15 years 5 months ago
2004
Springer
The clique problem consists in determining whether an undirected graph G of order n contains a clique of order . In this paper we are concerned with the decremental version of cliq...
104
Voted
AIPS
1994
15 years 1 months ago
1994
This paper concerns the specialization of arcconsistency algorithms for constraint satisfaction in the management of quantitative temporal constraint networks. Attention is devote...
106
click to vote
NIPS
1996
15 years 1 months ago
1996
In cellular telephone systems, an important problem is to dynamically allocate the communication resource channels so as to maximize service in a stochastic caller environment. Th...