Sciweavers

365 search results - page 3 / 73
» Local Computation Schemes with Partially Ordered Preferences
Sort
View
DPD
2008
136views more  DPD 2008»
13 years 5 months ago
A cache invalidation scheme for continuous partial match queries in mobile computing environments
The continuous partial match query is a partial match query whose result remains consistently in the client's memory. Conventional cache invalidation methods for mobile client...
Yon Dohn Chung
CONCUR
1999
Springer
13 years 9 months ago
Partial Order Reduction for Model Checking of Timed Automata
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
Marius Minea
CORR
2002
Springer
131views Education» more  CORR 2002»
13 years 5 months ago
Logic Programming with Ordered Disjunction
Abstract. Logic Programming paradigms that allow for expressing preferences have drawn a lot of research interest over the last years. Among them, the principle of ordered disjunct...
Gerhard Brewka
ICDE
2007
IEEE
119views Database» more  ICDE 2007»
13 years 11 months ago
Practical Preference Relations for Large Data Sets
User-defined preferences allow personalized ranking of query results. A user provides a declarative specification of his/her preferences, and the system is expected to use that ...
Kenneth A. Ross, Peter J. Stuckey, Amélie M...
AAAI
2008
13 years 7 months ago
Minimal Contraction of Preference Relations
Changing preferences is very common in real life. The expressive power of the operations of preference change introduced so far in the literature is limited to adding new informat...
Denis Mindolin, Jan Chomicki