Sciweavers

570 search results - page 38 / 114
» The Complexity of Reasoning with Global Constraints
Sort
View
WINE
2009
Springer
194views Economy» more  WINE 2009»
15 years 4 months ago
Mechanism Design for Complexity-Constrained Bidders
A well-known result due to Vickery gives a mechanism for selling a number of goods to interested buyers in a way that achieves the maximum social welfare. In practice, a problem wi...
Ravi Kumar, Mohammad Mahdian, Amin Sayedi
PVLDB
2010
82views more  PVLDB 2010»
14 years 8 months ago
Record Linkage with Uniqueness Constraints and Erroneous Values
Many data-management applications require integrating data from a variety of sources, where different sources may refer to the same real-world entity in different ways and some ma...
Songtao Guo, Xin Dong, Divesh Srivastava, Remi Zaj...
ALIFE
1999
14 years 9 months ago
The Creatures Global Digital Ecosystem
An arti cial life entertainment-software product called Creatures was released in Europe in late 1996 and in the United States and Japan in mid-1997. When installed on a domestic c...
Dave Cliff, Stephen Grand
ICDM
2008
IEEE
156views Data Mining» more  ICDM 2008»
15 years 4 months ago
Exploiting Local and Global Invariants for the Management of Large Scale Information Systems
This paper presents a data oriented approach to modeling the complex computing systems, in which an ensemble of correlation models are discovered to represent the system status. I...
Haifeng Chen, Haibin Cheng, Guofei Jiang, Kenji Yo...
CP
2007
Springer
15 years 1 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti