Search the dblp DataBase

Publications of Author

1. Xiaoxun Sun, Marek J. Druzdzel, Changhe Yuan
   Dynamic Weighting A* Search-Based MAP Algorithm for Bayesian Networks. [Citation Graph (0, 0)][DBLP]
   IJCAI, 2007, pp:2385-2390 [Conf]
   
2. Xiaoxun Sun, Sven Koenig
   The Fringe-Saving A* Search Algorithm - A Feasibility Study. [Citation Graph (0, 0)][DBLP]
   IJCAI, 2007, pp:2391-2397 [Conf]
   
3. Xiaotie Deng, Qizhi Fang, Xiaoxun Sun
   Finding nucleolus of flow game. [Citation Graph (0, 0)][DBLP]
   SODA, 2006, pp:124-131 [Conf]
   
4. Qizhi Fang, Rudolf Fleischer, Jian Li, Xiaoxun Sun
   Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games. [Citation Graph (0, 0)][DBLP]
   COCOON, 2007, pp:439-447 [Conf]
   
5. Xiaoxun Sun, Qizhi Fang
   Core Stability of Flow Games. [Citation Graph (0, 0)][DBLP]
   CJCDGCGT, 2005, pp:189-199 [Conf]
   
6. 
   An efficient hash-based algorithm for minimal k-anonymity. [Citation Graph (, )][DBLP]
   
   
7. 
   Microdata Protection Through Approximate Microaggregation. [Citation Graph (, )][DBLP]
   
   
8. 
   Path-Adaptive A* for Incremental Heuristic Search in Unknown Terrain. [Citation Graph (, )][DBLP]
   
   
9. 
   On the Complexity of Restricted k-anonymity Problem. [Citation Graph (, )][DBLP]
   
   
10. 
    Speeding up moving-target search. [Citation Graph (, )][DBLP]
    
    
11. 
    Generalized Adaptive A*. [Citation Graph (, )][DBLP]
    
    
12. 
    Trading off solution cost for smaller runtime in DCOP search algorithms. [Citation Graph (, )][DBLP]
    
    
13. 
    Simple optimization techniques for A*-based search. [Citation Graph (, )][DBLP]
    
    
14. 
    Dynamic fringe-saving A*. [Citation Graph (, )][DBLP]
    
    
15. 
    Generalized Fringe-Retrieving A*: faster moving target search on state lattices. [Citation Graph (, )][DBLP]
    
    
16. 
    Moving target D* Lite. [Citation Graph (, )][DBLP]
    
    
17. 
    L-Diversity Based Dynamic Update for Large Time-Evolving Microdata. [Citation Graph (, )][DBLP]
    
    
18. 
    Priority Driven K-Anonymisation for Privacy Protection. [Citation Graph (, )][DBLP]
    
    
19. 
    Injecting purpose and trust into data anonymisation. [Citation Graph (, )][DBLP]
    
    
20. 
    Optimal Privacy-Aware Path in Hippocratic Databases. [Citation Graph (, )][DBLP]
    
    
21. 
    Achieving P-Sensitive K-Anonymity via Anatomy. [Citation Graph (, )][DBLP]
    
    
22. 
    Efficient Incremental Search for Moving Target Search. [Citation Graph (, )][DBLP]
    
    
23. 
    Trading Off Solution Quality for Faster Computation in DCOP Search Algorithms. [Citation Graph (, )][DBLP]
    
    
24. 
    Satisfying Privacy Requirements: One Step before Anonymization. [Citation Graph (, )][DBLP]
    
    
25. 
    Dynamic Weighting A* Search-based MAP Algorithm for Bayesian Networks. [Citation Graph (, )][DBLP]
    
    
26. 
    Extended K-Anonymity Models Against Attribute Disclosure. [Citation Graph (, )][DBLP]
    
    
27. 
    Comparing real-time and incremental heuristic search for real-time situated agents. [Citation Graph (, )][DBLP]