Sciweavers

725 search results - page 101 / 145
» Complexity of Computing with Extended Propositional Logic Pr...
Sort
View
148
Voted
ATAL
2009
Springer
15 years 9 months ago
Boolean combinations of weighted voting games
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...
Piotr Faliszewski, Edith Elkind, Michael Wooldridg...
145
Voted
COMSWARE
2007
IEEE
15 years 9 months ago
OASiS: A Programming Framework for Service-Oriented Sensor Networks
Abstract— Wireless sensor networks consist of small, inexpensive devices which interact with the environment, communicate with each other, and perform distributed computations in...
Manish Kushwaha, Isaac Amundson, Xenofon D. Koutso...
108
Voted
EUROPAR
1999
Springer
15 years 6 months ago
DAOS - Scalable And-Or Parallelism
Abstract. This paper presents DAOS, a model for exploitation of Andand Or-parallelism in logic programs. DAOS assumes a physically distributed memory environment and a logically sh...
Luís Fernando Castro, Vítor Santos C...
244
Voted
POPL
2003
ACM
16 years 2 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
139
Voted
DLOG
2008
15 years 4 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer