Analysis of Approximation Algorithms for Maximal Temporal Constraint Satisfaction Problems
M. Mouhoub. Analysis of Approximation Algorithms for Maximal Temporal Constraint Satisfaction Problems. The 2001 International Conference on Artificial Intelligence(IC-AI'2001), pages 165-171, Las Vegas, 2001.
This paper presents an experimental study of the different local
search techniques to solve Maximal Temporal... more
This paper presents an experimental study of the different local
search techniques to solve Maximal Temporal Constraint Satisfaction Problems. Comparisons were carried out using Min-Conflicts-Random-Walk, Steepest-Descent-Random-Walk and Tabu Search methods. Empirical evidence shows that the Min-Conflicts-Random-Walk method finds almost always solutions of better quality, i.e solutions having smaller number of violated constraints and is faster than the other approximation methods to find solutions of the same quality.
7 views
Seen by:Mining User Home Location and Gender from Flickr Tags
Adrian Popescu, Gregory Grefenstette Mining User Home Location and Gender from Flickr Tags, ICWSM 2010, May 23 - 26, Washington DC, USA
Personal photos and their associated metadata reveal different aspects of our lives and, when shared online, let... more Personal photos and their associated metadata reveal different aspects of our lives and, when shared online, let others have an idea about us. Automating the extraction of personal information is an arduous task but it contributes to better understanding and serving users. Here we present methods for analyzing textual metadata associated to Flickr photos that unveil users’ home location and gender. We test our techniques on a sample of 30,000 people coming from six different countries, allowing us to compare results across cultures and point out similarities and differences.
17 views
Seen by:
