2421 search results - page 128 / 485 » Approximate Flow-Aware Networking |
189
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
130
Voted
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
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...
131
click to vote
SARA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. This article introduces a technique for improving the efficiency of diagnosis through approximate compilation. We extend the approach of compiling a diagnostic model, as...
125
click to vote
ATMOS
2007
15 years 4 months ago
2007
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
145
click to vote
SIAMCOMP
2008
15 years 3 months ago
2008
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...