Sciweavers

3715 search results - page 619 / 743
» A Space Optimization for FP-Growth
Sort
View
IJCAI
2007
13 years 9 months ago
Constraint Partitioning for Solving Planning Problems with Trajectory Constraints and Goal Preferences
The PDDL3 specifications include soft goals and trajectory constraints for distinguishing highquality plans among the many feasible plans in a solution space. To reduce the compl...
Chih-Wei Hsu, Benjamin W. Wah, Ruoyun Huang, Yixin...
IJCAI
2007
13 years 9 months ago
A Heuristic Search Approach to Planning with Temporally Extended Preferences
In this paper we propose a suite of techniques for planning with temporally extended preferences (TEPs). To this end, we propose a method for compiling TEP planning problems into ...
Jorge A. Baier, Fahiem Bacchus, Sheila A. McIlrait...
LWA
2007
13 years 9 months ago
Multi-objective Frequent Termset Clustering
Large, high dimensional data spaces, are still a challenge for current data clustering methods. Frequent Termset (FTS) clustering is a technique developed to cope with these chall...
Andreas Kaspari, Michael Wurst
NETWORKING
2007
13 years 9 months ago
On-Demand Routing in Disrupted Environments
While current on-demand routing protocols are optimized to take into account unique features of mobile ad hoc networks (MANETs) such as frequent topology changes and limited batter...
Jay Boice, J. J. Garcia-Luna-Aceves, Katia Obraczk...
SDM
2007
SIAM
204views Data Mining» more  SDM 2007»
13 years 9 months ago
Flexible Anonymization For Privacy Preserving Data Publishing: A Systematic Search Based Approach
k-anonymity is a popular measure of privacy for data publishing: It measures the risk of identity-disclosure of individuals whose personal information are released in the form of ...
Bijit Hore, Ravi Chandra Jammalamadaka, Sharad Meh...