Sciweavers

25 search results - page 5 / 5
» sat 2011
Sort
View
JAIR
2011
103views more  JAIR 2011»
12 years 10 months ago
Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets o...
C. Geist, Ulrich Endriss
ICDE
2011
IEEE
274views Database» more  ICDE 2011»
12 years 7 months ago
Collaborative caching for spatial queries in Mobile P2P Networks
Abstract—We propose a novel collaborative caching framework to support spatial query processing in Mobile Peer-toPeer Networks (MP2PNs). To maximize cache sharing among clients, ...
Qijun Zhu, Dik Lun Lee, Wang-Chien Lee
CORR
2011
Springer
172views Education» more  CORR 2011»
12 years 10 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
DLOG
2011
12 years 7 months ago
On the Problem of Weighted Max-DL-SAT and its Application to Image Labeling
Abstract. For a number of problems, such as ontology learning or image labeling, we need to handle uncertainty and inconsistencies in an appropriate way. Fuzzy and Probabilistic De...
Stefan Scheglmann, Carsten Saathoff, Steffen Staab
LOGCOM
2011
12 years 6 months ago
Introducing Preferences in Planning as Satisfiability
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: satplan has been the winning system in the deterministic track for optim...
Enrico Giunchiglia, Marco Maratea