1258 search results - page 105 / 252 » Architecture-driven Problem Decomposition |
148
click to vote
AAAI
1994
15 years 3 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
119
click to vote
STACS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
123
Voted
IJCAI
1989
15 years 2 months ago
1989
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de sign task takes as input the specifications of the desired functions of a device...
130
click to vote
JC
2007
15 years 1 months ago
2007
A discontinuous Galerkin (DG) discretization of Dirichlet problem for second-order elliptic equations with discontinuous coefficients in 2-D is considered. For this discretization...
122
click to vote
AICCSA
2007
IEEE
15 years 8 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...