Sciweavers

966 search results - page 124 / 194
» Communicating Answer Set Programs
Sort
View
149
Voted
LOPSTR
2007
Springer
15 years 8 months ago
Snapshot Generation in a Constructive Object-Oriented Modeling Language
CooML is an object-oriented modeling language where specifications are theories in a constructive logic designed to handle incomplete information. In this logic we view snapshots ...
Mauro Ferrari, Camillo Fiorentini, Alberto Momigli...
CP
2003
Springer
15 years 7 months ago
Terminating Decision Algorithms Optimally
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
Tuomas Sandholm
98
Voted
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 2 months ago
Heuristics in Conflict Resolution
Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming (ASP) are based on sophisticated Boolean constraint solving techniques. In both areas, conflict-driven l...
Christian Drescher, Martin Gebser, Benjamin Kaufma...
125
Voted
TISSEC
2008
235views more  TISSEC 2008»
15 years 2 months ago
SDAP: A Secure Hop-by-Hop Data Aggregation Protocol for Sensor Networks
Hop-by-hop data aggregation is a very important technique for reducing the communication overhead and energy expenditure of sensor nodes during the process of data collection in a...
Yi Yang, Xinran Wang, Sencun Zhu, Guohong Cao
128
Voted
STOC
2006
ACM
134views Algorithms» more  STOC 2006»
16 years 2 months ago
Byzantine agreement in the full-information model in O(log n) rounds
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan