2005
DOI: 10.1143/ptps.157.338
|View full text |Cite
|
Sign up to set email alerts
|

Pseudo Expectation: A Tool for Analyzing Local Search Algorithms

Abstract: Abstract.In [WST03], the notion of pseudo expectation has been proposed for analyzing relatively simple Markov processes, which would be often seen as simple execution models of local search algorithms. In this paper, we first explain how it is used, and then investigate the approximation error bound of pseudo expectations.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2005
2005
2006
2006

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
references
References 5 publications
0
0
0
Order By: Relevance