Sciweavers

10051 search results - page 315 / 2011
» A Dynamic Separator Algorithm
Sort
View
MP
1998
117views more  MP 1998»
15 years 6 months ago
The node capacitated graph partitioning problem: A computational study
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
Carlos Eduardo Ferreira, Alexander Martin, C. Carv...
ICASSP
2011
IEEE
14 years 10 months ago
Degenerate Unmixing Estimation Technique using the Constant Q Transform
The Degenerate Unmixing Estimation Technique (DUET) is a Blind Source Separation (BSS) algorithm for stereo audio. DUET depends on an amplitude-phase 2d histogram built from the d...
Zafar Rafii, Bryan Pardo
AIPS
2009
15 years 8 months ago
Incremental Policy Generation for Finite-Horizon DEC-POMDPs
Solving multiagent planning problems modeled as DECPOMDPs is an important challenge. These models are often solved by using dynamic programming, but the high resource usage of cur...
Christopher Amato, Jilles Steeve Dibangoye, Shlomo...
FSTTCS
2005
Springer
16 years 11 days ago
Monitoring Stable Properties in Dynamic Peer-to-Peer Distributed Systems
Monitoring a distributed system to detect a stable property is an important problem with many applications. The problem is especially challenging for a dynamic distributed system b...
Sathya Peri, Neeraj Mittal
CP
2004
Springer
15 years 10 months ago
Concurrent Dynamic Backtracking for Distributed CSPs
A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search proc...
Roie Zivan, Amnon Meisels