Sciweavers

125 search results - page 19 / 25
» Combining Theories with Shared Set Operations
Sort
View
104
Voted
JAR
2006
236views more  JAR 2006»
14 years 11 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
99
Voted
ATAL
2009
Springer
15 years 6 months ago
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
Tammar Shrot, Yonatan Aumann, Sarit Kraus
79
Voted
CDC
2009
IEEE
117views Control Systems» more  CDC 2009»
15 years 4 months ago
Information dissemination in networks via linear iterative strategies over finite fields
— Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values...
Shreyas Sundaram, Christoforos N. Hadjicostis
87
Voted
LOGCOM
2008
94views more  LOGCOM 2008»
14 years 11 months ago
Preservation of Interpolation Features by Fibring
Fibring is a metalogical constructor that permits to combine different logics by operating on their deductive systems under certain natural restrictions, as for example that the t...
Walter Alexandre Carnielli, João Rasga, Cri...
PPOPP
2009
ACM
16 years 6 days ago
Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
Tong Li, Dan P. Baumberger, Scott Hahn