254 search results - page 15 / 51 » On the randomized solution of initial value problems |
CISS
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—To achieve higher reliability, safety, and faulttolerance, many mission-critical detection and decision systems implement consensus algorithms that force the systems’ ...
AMC
2007
13 years 7 months ago
2007
Adomian decomposition method has been used intensively to solve nonlinear boundary and initial value problems. It has been proved to be very efficient in generating series solutio...
IJCAI
1989
13 years 8 months ago
1989
This paper describes a program, called NEWTON, that finds approximate symbolic solutions to parameterized equations in one variable. N E W T O N derives an initial approximation b...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
IBERAMIA
2004
Springer
14 years 29 days ago
2004
Springer
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...