Sciweavers

569 search results - page 19 / 114
» An Efficient Algorithm for Solving Dynamic Complex DCOP Prob...
Sort
View
PODC
2010
ACM
13 years 10 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer
DISOPT
2008
89views more  DISOPT 2008»
13 years 8 months ago
A pricing problem under Monge property
We study a pricing problem where buyers with non-uniform demand purchase one of many items. Each buyer has a known benefit for each item and purchases the item that gives the larg...
Oktay Günlük
CIC
2004
118views Communications» more  CIC 2004»
13 years 10 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng
JSS
2006
155views more  JSS 2006»
13 years 8 months ago
Semantic component networking: Toward the synergy of static reuse and dynamic clustering of resources in the knowledge grid
Model is a kind of codified knowledge that has been verified in solving problems. Solving a complex problem usually needs a set of models. Using components, the composition of a s...
Hai Zhuge
ATAL
2010
Springer
13 years 9 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein