Sciweavers

8838 search results - page 90 / 1768
» Generalizing Domain Theory
Sort
View
AAAI
1994
15 years 5 months ago
A Filtering Algorithm for Constraints of Difference in CSPs
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...
Jean-Charles Régin
EACL
1989
ACL Anthology
15 years 5 months ago
Inference in DATR
DATR is a declarative language for representing a restricted class of inheritance networks, permitting both multiple and default inheritance. The principal intended area of applic...
Roger Evans, Gerald Gazdar
CSR
2009
Springer
15 years 5 months ago
Approximability of the Maximum Solution Problem for Certain Families of Algebras
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
Peter Jonsson, Johan Thapper
SIGECOM
2008
ACM
152views ECommerce» more  SIGECOM 2008»
15 years 3 months ago
On characterizations of truthful mechanisms for combinatorial auctions and scheduling
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
Shahar Dobzinski, Mukund Sundararajan
SIGIR
2008
ACM
15 years 3 months ago
Measuring concept relatedness using language models
Over the years, the notion of concept relatedness has attracted considerable attention. A variety of approaches, based on ontology structure, information content, association, or ...
Dolf Trieschnigg, Edgar Meij, Maarten de Rijke, We...