Sciweavers

711 search results - page 83 / 143
» Amalgams of Constraint Satisfaction Problems
Sort
View
NSDI
2007
15 years 7 months ago
Octant: A Comprehensive Framework for the Geolocalization of Internet Hosts
Determining the physical location of Internet hosts is a critical enabler for many new location-aware services. In this paper, we present Octant, a novel, comprehensive framework ...
Bernard Wong, Ivan Stoyanov, Emin Gün Sirer
149
Voted
AI
2003
Springer
15 years 9 months ago
A Graph Based Backtracking Algorithm for Solving General CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
Wanlin Pang, Scott D. Goodwin
199
Voted
SIGMOD
2007
ACM
183views Database» more  SIGMOD 2007»
16 years 4 months ago
Leveraging aggregate constraints for deduplication
We show that aggregate constraints (as opposed to pairwise constraints) that often arise when integrating multiple sources of data, can be leveraged to enhance the quality of dedu...
Surajit Chaudhuri, Anish Das Sarma, Venkatesh Gant...
AIPS
2007
15 years 7 months ago
Managing Personal Tasks with Time Constraints and Preferences
This paper treats the problem of managing personal tasks, through an adaptation of the Squeaky Wheel Optimization (SWO) framework, enhanced with powerful heuristics and full const...
Ioannis Refanidis
CP
2004
Springer
15 years 10 months ago
Preprocessing Techniques for Distributed Constraint Optimization
Abstract. Although algorithms for Distributed Constraint Optimization Problems (DCOPs) have emerged as a key technique for distributed reasoning, their application faces significa...
Syed Muhammad Ali, Sven Koenig, Milind Tambe