Sciweavers

543 search results - page 66 / 109
» A Multiagent Algorithm for Graph Partitioning
Sort
View
SWAT
2010
Springer
250views Algorithms» more  SWAT 2010»
14 years 1 months ago
Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov...
ALT
2007
Springer
14 years 5 months ago
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
Lev Reyzin, Nikhil Srivastava
CP
2011
Springer
12 years 7 months ago
Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Mako...
ATAL
2005
Springer
14 years 1 months ago
Modeling complex multi-issue negotiations using utility graphs
This paper presents an agent strategy for complex bilateral negotiations over many issues with inter-dependent valuations. We use ideas inspired by graph theory and probabilistic ...
Valentin Robu, D. J. A. Somefun, Johannes A. La Po...
AUTOMATICA
2008
115views more  AUTOMATICA 2008»
13 years 8 months ago
Distributed algorithms for reaching consensus on general functions
This paper presents analysis and design results for distributed consensus algorithms in multi-agent networks. We consider continuous consensus functions of the initial state of th...
Jorge Cortés