2474 search results - page 34 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
101
click to vote
AAAI
1998
15 years 3 months ago
1998
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
140
click to vote
ISAAC
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
140
click to vote
EWSN
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
103
click to vote
APPT
2005
Springer
15 years 7 months ago
2005
Springer
By reasonably allocating a cooperative problem which need multiple solvers cope with together, the problem could be performed more effectively and efficiently. A problem could be d...
196
click to vote
PDPTA
2010
14 years 11 months ago
2010
Lattice gas cellular automata (LGCA) models provide a relatively fast means of simulating fluid flow and can give both quantitative and qualitative insights into flow patterns aro...