Sciweavers

698 search results - page 37 / 140
» A Deterministic Algorithm for Solving Imprecise Decision Pro...
Sort
View
CADE
2012
Springer
11 years 11 months ago
A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic
Abstract. This paper describes a novel decision procedure for quantifierfree linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domai...
François Bobot, Sylvain Conchon, Evelyne Co...
CORR
2010
Springer
58views Education» more  CORR 2010»
13 years 7 months ago
Realizable Paths and the NL vs L Problem
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
Shiva Kintali
ATAL
2007
Springer
14 years 1 months ago
Modeling plan coordination in multiagent decision processes
In multiagent planning, it is often convenient to view a problem as two subproblems: agent local planning and coordination. Thus, we can classify agent activities into two categor...
Ping Xuan
AIPS
2008
13 years 11 months ago
Stochastic Planning with First Order Decision Diagrams
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
Saket Joshi, Roni Khardon
GECCO
2004
Springer
132views Optimization» more  GECCO 2004»
14 years 2 months ago
Robust and Efficient Genetic Algorithms with Hierarchical Niching and a Sustainable Evolutionary Computation Model
This paper proposes a new niching method named hierarchical niching, which combines spatial niching in search space and a continuous temporal niching concept. The method is natural...
Jianjun Hu, Erik D. Goodman