5595 search results - page 372 / 1119 » Approximation Algorithms for Clustering Problems |
193
click to vote
FSTTCS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
177
click to vote
ATAL
2007
Springer
16 years 29 days ago
2007
Springer
A problem of planning for cooperative teams under uncertainty is a crucial one in multiagent systems. Decentralized partially observable Markov decision processes (DECPOMDPs) prov...
192
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
200
click to vote
HYBRID
2000
Springer
15 years 10 months ago
2000
Springer
In this paper we describe an experimental system called d=dt for approximating reachable states for hybrid systems whose continuous dynamics is de ned by linear di erential equatio...
193
click to vote
ADHOCNOW
2005
Springer
16 years 10 days ago
2005
Springer
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner t...