Sciweavers

321 search results - page 2 / 65
» Enabling local computation for partially ordered preferences
Sort
View
HEURISTICS
2006
102views more  HEURISTICS 2006»
13 years 5 months ago
A logic of soft constraints based on partially ordered preferences
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...
Nic Wilson
AMAI
2007
Springer
13 years 5 months ago
Database querying under changing preferences
We present here a formal foundation for an iterative and incremental approach to constructing and evaluating preference queries. Our main focus is query modification: a query tran...
Jan Chomicki
IJCSA
2007
143views more  IJCSA 2007»
13 years 5 months ago
Incremental Trade-Off Management for Preference-Based Queries
Preference-based queries often referred to as skyline queries play an important role in cooperative query processing. However, their prohibitive result sizes pose a severe challen...
Wolf-Tilo Balke, Ulrich Güntzer, Christoph Lo...
IDEAS
2006
IEEE
104views Database» more  IDEAS 2006»
13 years 11 months ago
Exploiting Indifference for Customization of Partial Order Skylines
Unlike numerical preferences, preferences on attribute values do not show an inherent total order, but skyline computation has to rely on partial orderings explicitly stated by th...
Wolf-Tilo Balke, Ulrich Güntzer, Wolf Sibersk...
ICDE
2004
IEEE
110views Database» more  ICDE 2004»
14 years 6 months ago
LDC: Enabling Search By Partial Distance In A Hyper-Dimensional Space
Recent advances in research fields like multimedia and bioinformatics have brought about a new generation of hyper-dimensional databases which can contain hundreds or even thousan...
Nick Koudas, Beng Chin Ooi, Heng Tao Shen, Anthony...