Sciweavers

72 search results - page 10 / 15
» Minimal Contraction of Preference Relations
Sort
View
AAAI
2006
13 years 11 months ago
Improved Bounds for Computing Kemeny Rankings
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the...
Vincent Conitzer, Andrew J. Davenport, Jayant Kala...
CATA
2003
13 years 11 months ago
Efficient Even Distribution of Power Consumption in Wireless Sensor Networks
One of the limitations of wireless sensor nodes is their inherent limited energy resource. Besides maximizing the lifetime of the sensor node, it is preferable to distribute the e...
Ioan Raicu
ACMSE
2005
ACM
14 years 3 months ago
The bipartite clique: a topological paradigm for WWWeb user search customization
Web user search customization research has been fueled by the recognition that if the WWW is to attain to its optimal potential as an interactive medium the development of new and...
Brenda F. Miles, Vir V. Phoha
COCOON
2003
Springer
14 years 2 months ago
Graph Coloring and the Immersion Order
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...
Faisal N. Abu-Khzam, Michael A. Langston
LPAR
2007
Springer
14 years 3 months ago
Preferential Description Logics
In this paper we propose a nonmonotonic extension ALC + Tmin of the Description Logic ALC for reasoning about prototypical properties and inheritance with exception. The logic ALC ...
Laura Giordano, Valentina Gliozzi, Nicola Olivetti...