Sciweavers

318 search results - page 20 / 64
» Real Number Computability and Domain Theory
Sort
View
ATAL
2008
Springer
13 years 10 months ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan
NETWORKING
2007
13 years 10 months ago
Construction of a Proxy-Based Overlay Skeleton Tree for Large-Scale Real-Time Group Communications
Abstract. We consider the problem of constructing a proxy-based overlay skeleton tree (POST) in the backbone service domain of a two-tier overlay multicast infrastructure. Spanning...
Jun Guo, Sanjay Jha
ATAL
2008
Springer
13 years 10 months ago
Approximating power indices
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
Yoram Bachrach, Evangelos Markakis, Ariel D. Proca...
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
14 years 3 months ago
Extended probe method for linkage discovery over high-cardinality alphabets
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
Shude Zhou, Zengqi Sun, Robert B. Heckendorn
CAV
2009
Springer
123views Hardware» more  CAV 2009»
14 years 24 days ago
On Using Floating-Point Computations to Help an Exact Linear Arithmetic Decision Procedure
We consider the decision problem for quantifier-free formulas whose atoms are linear inequalities interpreted over the reals or rationals. This problem may be decided using satisf...
David Monniaux