1149 search results - page 110 / 230 » What Are Iteration Theories |
FSTTCS
1991
Springer
14 years 12 days ago
1991
Springer
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
ACSD
2008
IEEE
13 years 11 months ago
2008
IEEE
In this paper we present an algorithm to synthesize a finite unlabeled place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by a term ove...
FCS
2006
13 years 10 months ago
2006
: In this paper, functioning and interaction of distributed devices and concurrent algorithms are analyzed in the context of the theory of algorithms. Although different systems in...
ICML
2010
IEEE
13 years 10 months ago
2010
IEEE
We consider approximate policy evaluation for finite state and action Markov decision processes (MDP) in the off-policy learning context and with the simulation-based least square...
CPHYSICS
2007
13 years 8 months ago
2007
We illustrate recent progress in developing algorithms for solving the Kohn-Sham problem. Key ingredients of our algorithm include pseudopotentials implemented on a real space gri...