Sciweavers

972 search results - page 93 / 195
» Using Preference Order in Ontologies
Sort
View
AAAI
2008
14 years 19 days ago
Voting on Multiattribute Domains with Cyclic Preferential Dependencies
In group decision making, often the agents need to decide on multiple attributes at the same time, so that there are exponentially many alternatives. In this case, it is unrealist...
Lirong Xia, Vincent Conitzer, Jérôme ...
ICDE
2003
IEEE
114views Database» more  ICDE 2003»
14 years 11 months ago
Ranked Join Indices
A plethora of data sources contain data entities that could be ordered according to a variety of attributes associated with the entities. Such orderings result effectively in a ra...
Panayiotis Tsaparas, Themistoklis Palpanas, Yannis...
AAAI
2010
13 years 11 months ago
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. It is import...
Felix Brandt, Markus Brill, Edith Hemaspaandra, La...
ICDE
2003
IEEE
183views Database» more  ICDE 2003»
14 years 11 months ago
Skyline with Presorting
There has been interest recently in skyline queries, also called Pareto queries, on relational databases. Relational query languages do not support search for "best" tupl...
Jan Chomicki, Parke Godfrey, Jarek Gryz, Dongming ...
PERCOM
2005
ACM
14 years 10 months ago
Applying a Disciplined Approach to the Development of a Context-Aware Communication Application
Pervasive computing applications must be engineered to provide unprecedented levels of flexibility in order to reconfigure and adapt in response to changes in computing resources ...
Ted McFadden, Karen Henricksen, Jadwiga Indulska, ...