658 search results - page 72 / 132 » Partially Ordered Constraint Optimization Problems |
117
click to vote
SDM
2004
SIAM
15 years 2 months ago
2004
SIAM
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
124
click to vote
IJCAI
2007
15 years 2 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
119
click to vote
ATAL
2007
Springer
15 years 7 months ago
2007
Springer
Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve...
109
click to vote
CCR
2000
15 years 1 months ago
2000
Distributed optimal traffic engineering in the presence of multiple paths has been found to be a difficult problem to solve. In this paper, we introduce a new approach in an attem...
AAAI
2006
15 years 2 months ago
2006
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...