7 search results - page 1 / 2 » Evolutionary Search for Minimal Elements in Partially Ordere... |
EPS
1998
Springer
13 years 9 months ago
1998
Springer
The task of finding minimal elements of a partially ordered set is a generalization of the task of finding the global minimum of a real-valued function or of finding Pareto-optimal...
CAP
2010
12 years 11 months ago
2010
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
DAM
2008
13 years 4 months ago
2008
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...