Sciweavers

462 search results - page 74 / 93
» Preference Reasoning
Sort
View
PCM
2005
Springer
288views Multimedia» more  PCM 2005»
14 years 2 months ago
Adaptive Deinterlacing for Real-Time Applications
In general, motion compensated (MC) deinterlacing algorithms can outperform non-MC (NMC) ones. However, we often prefer to choose the latter due to the considerations of error prop...
Qian Huang, Wen Gao, Debin Zhao, Huifang Sun
EWCBR
2004
Springer
14 years 2 months ago
Dynamic Critiquing
Abstract. Critiquing is a powerful style of feedback for case-based recommender systems. Instead of providing detailed feature values, users indicate a directional preference for a...
James Reilly, Kevin McCarthy, Lorraine McGinty, Ba...
FOIKS
2004
Springer
14 years 2 months ago
Implementing Ordered Choice Logic Programming using Answer Set Solvers
Abstract. Ordered Choice Logic Programming (OCLP) allows for dynamic preference-based decision-making with multiple alternatives without the need for any form of negation. This com...
Marina De Vos
ICGI
2004
Springer
14 years 2 months ago
Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA
State Merging algorithms, such as Rodney Price’s EDSM (Evidence-Driven State Merging) algorithm, have been reasonably successful at solving DFA-learning problems. EDSM, however, ...
John Abela, François Coste, Sandro Spina
KR
2004
Springer
14 years 2 months ago
On Merging Strategy-Proofness
Merging operators aim at defining the beliefs/goals of a group of agents from the beliefs/goals of each member of the group. Whenever an agent of the group has preferences over t...
Patricia Everaere, Sébastien Konieczny, Pie...