Sciweavers

1887 search results - page 7 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
PVLDB
2010
135views more  PVLDB 2010»
13 years 2 months ago
Efficient Skyline Evaluation over Partially Ordered Domains
Although there has been a considerable body of work on skyline evaluation in multidimensional data with totally ordered attribute domains, there are only a few methods that consid...
Shiming Zhang, Nikos Mamoulis, Ben Kao, David Wai-...
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
14 years 8 months ago
Algorithms for discovering bucket orders from data
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
Aristides Gionis, Heikki Mannila, Kai Puolamä...
AAAI
1998
13 years 9 months ago
Generalizing Partial Order and Dynamic Backtracking
RecentlyFtwo new backtracking algorithmsF dynamic backtracking (DB)and partial order dynamicbacktracking (PDB) have been presented. These algorithms have the property to be additi...
Christian Bliek
ICTAI
2000
IEEE
13 years 11 months ago
Building efficient partial plans using Markov decision processes
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
Pierre Laroche