Sciweavers

16091 search results - page 262 / 3219
» Solving
Sort
View
AIPS
2011
14 years 10 months ago
Searching for Plans with Carefully Designed Probes
We define a probe to be a single action sequence computed greedily from a given state that either terminates in the goal or fails. We show that by designing these probes carefull...
Nir Lipovetzky, Hector Geffner
STOC
2007
ACM
128views Algorithms» more  STOC 2007»
16 years 6 months ago
Iteratively constructing preconditioners via the conjugate gradient method
We consider the problem of solving a symmetric, positive definite system of linear equations. The most well-known and widely-used method for solving such systems is the preconditi...
John Dunagan, Nicholas J. A. Harvey
ATAL
2009
Springer
16 years 1 months ago
Generalizing DPOP: Action-GDL, a new complete algorithm for DCOPs
In this paper we propose a novel message-passing algorithm, the so-called Action-GDL, as an extension to the Generalized Distributive Law algorithm (GDL) [1] to efficiently solve...
Meritxell Vinyals, Juan A. Rodríguez-Aguila...
SAGA
2009
Springer
16 years 1 months ago
Scenario Reduction Techniques in Stochastic Programming
Stochastic programming problems appear as mathematical models for optimization problems under stochastic uncertainty. Most computational approaches for solving such models are base...
Werner Römisch
GRC
2007
IEEE
16 years 27 days ago
Structured Writing with Granular Computing Strategies
— Granular computing unifies structured thinking, structured problem solving and structured information processing. In order to see the flexibility and universal applicability ...
Yiyu Yao