Sciweavers

177 search results - page 13 / 36
» Splitting a Default Theory
Sort
View
JSYML
2010
81views more  JSYML 2010»
13 years 1 months ago
Groupoids, covers, and 3-uniqueness in stable theories
Abstract. Building on Hrushovski's work in [5], we study definable groupoids in stable theories and their relationship with 3-uniqueness and finite internal covers. We introdu...
John Goodrick, Alexei Kolesnikov
CORR
2008
Springer
217views Education» more  CORR 2008»
13 years 6 months ago
A Distributed Merge and Split Algorithm for Fair Cooperation in Wireless Networks
Abstract-- This paper introduces a novel concept from coalitional game theory which allows the dynamic formation of coalitions among wireless nodes. A simple and distributed merge ...
Walid Saad, Zhu Han, Mérouane Debbah, Are H...
CORR
2011
Springer
215views Education» more  CORR 2011»
13 years 1 months ago
The total path length of split trees
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
Nicolas Broutin, Cecilia Holmgren
CONCUR
2012
Springer
11 years 9 months ago
MSO Decidability of Multi-Pushdown Systems via Split-Width
Abstract. Multi-threaded programs with recursion are naturally modeled as multi-pushdown systems. The behaviors are represented as multiply nested words (MNWs), which are words enr...
Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar
ATAL
2009
Springer
14 years 1 months ago
False name manipulations in weighted voting games: splitting, merging and annexation
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational compl...
Haris Aziz, Mike Paterson