2356 search results - page 95 / 472 » Characterizations of postman sets |
127
click to vote
AUSAI
1999
Springer
15 years 8 months ago
1999
Springer
This paper analyzes the notion of a minimal belief change that incorporates new information. I apply the fundamental decisiontheoretic principle of Pareto-optimality to derive a no...
152
click to vote
IJCAI
2001
15 years 5 months ago
2001
We are interested in semantical underpinnings for existing approaches to preference handling in extended logic programming (within the framework of answer set programming). As a s...
124
click to vote
SIGECOM
2008
ACM
15 years 4 months ago
2008
ACM
Often, we wish to design incentive-compatible algorithms for settings in which the players' private information is drawn from discrete domains (e.g., integer values). Our mai...
140
click to vote
ISCA
2011
IEEE
14 years 8 months ago
2011
IEEE
Much of the success of the Internet services model can be attributed to the popularity of a class of workloads that we call Online Data-Intensive (OLDI) services. These workloads ...
129
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
−A class of combinatorial structures, called absorbing sets, strongly influences the performance of low-density paritycheck (LDPC) decoders. In particular, the quantization schem...