Sciweavers

729 search results - page 119 / 146
» Solving subgraph isomorphism problems with constraint progra...
Sort
View
97
Voted
WLP
1997
Springer
15 years 1 months ago
Constrained Partial Deduction
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
Michael Leuschel, Danny De Schreye
SAC
2006
ACM
14 years 9 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...
IFIP
2007
Springer
15 years 3 months ago
A Framework for QoS Contract Negotiation in Component-Based Applications
The support of QoS properties in component-based software requires the run-time selection of appropriate concrete QoS contracts at the ports of the interacting components. Such a s...
Mesfin Mulugeta, Alexander Schill
72
Voted
CP
2005
Springer
15 years 3 months ago
Tree Decomposition with Function Filtering
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
Martí Sánchez, Javier Larrosa, Pedro...
95
Voted
ICIP
2004
IEEE
15 years 11 months ago
Optimal object-based video communications over differentiated services networks
In this paper, we propose an optimal unequal error protection scheme for object-based video communications over differentiated services networks. Our goal is to achieve the best v...
Haohong Wang, Fan Zhai, Yiftach Eisenberg, Aggelos...