2386 search results - page 364 / 478 » Representing and Reasoning with Preferences |
WWW
2003
ACM
15 years 10 months ago
2003
ACM
The presence of replicas or near-replicas of documents is very common on the Web. Documents may be replicated completely or partially for different reasons (versions, mirrors, etc...
173
click to vote
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
We present an implementation of table constraints in CLP(FD). For binary constraints, the supports of each value are represented as a finite-domain variable, and action rules are u...
164
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
CHI
2009
ACM
15 years 10 months ago
2009
ACM
While the collection of behavioral protocols has been common practice in human-computer interaction research for many years, the analysis of large protocol data sets is often extr...