1887 search results - page 1 / 378 » An efficient search algorithm for partially ordered sets |
ACST
2006
14 years 17 days ago
2006
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
EPS
1998
Springer
14 years 3 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...
DAM
2008
13 years 11 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...
ICDM
2009
IEEE
13 years 9 months ago
2009
IEEE
Given a large transaction database, association analysis is concerned with efficiently finding strongly related objects. Unlike traditional associate analysis, where relationships ...
AIPS
2010
13 years 11 months ago
2010
Over the last few years there has been a revival of interest in the idea of least-commitment planning with a number of researchers returning to the partial-order planning approach...