9325 search results - page 223 / 1865 » The decentralized implementability problem |
129
Voted
CPAIOR
2009
Springer
15 years 10 months ago
2009
Springer
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...
149
Voted
LPNMR
2007
Springer
15 years 9 months ago
2007
Springer
We describe BE, an implemented system for solving belief change problems in the presence of actions. We illustrate how we can use BE to compute the result of belief progression, be...
176
Voted
TAINN
2005
Springer
15 years 9 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
134
Voted
MP
2008
15 years 3 months ago
2008
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
113
Voted
CPAIOR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This work presents methods for processing a constraint satisfaction problem (CSP) formulated by an expression-based language, before the CSP is presented to a stochastic ...