Sciweavers

255 search results - page 25 / 51
» Generalizing Consistency and other Constraint Properties to ...
Sort
View
86
Voted
FCSC
2008
104views more  FCSC 2008»
14 years 10 months ago
On automatic verification of self-stabilizing population protocols
The population protocol model [2] has emerged as an elegant computation paradigm for describing mobile ad hoc networks, consisting of a number of mobile nodes that interact with e...
Jun Pang, Zhengqin Luo, Yuxin Deng
ATAL
2009
Springer
15 years 4 months ago
On the complexity of schedule control problems for knockout tournaments
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...
Thuc Vu, Alon Altman, Yoav Shoham
FC
2005
Springer
120views Cryptology» more  FC 2005»
15 years 3 months ago
Achieving Fairness in Private Contract Negotiation
Abstract. Suppose Alice and Bob are two entities (e.g. agents, organizations, etc.) that wish to negotiate a contract. A contract consists of several clauses, and each party has ce...
Keith B. Frikken, Mikhail J. Atallah
CORR
2010
Springer
117views Education» more  CORR 2010»
14 years 10 months ago
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs
A key factor that can dramatically reduce the search space during constraint solving is the criterion under which the variable to be instantiated next is selected. For this purpos...
Thanasis Balafoutis, Kostas Stergiou
94
Voted
IJCAI
1997
14 years 11 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter