9842 search results - page 1671 / 1969 » The Complexity of the Matching-Cut Problem |
177
click to vote
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
Previous work in multiagent coordination has addressed the challenge of planning in domains where agents must optimize a global goal, while satisfying local resource constraints. ...
135
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
150
Voted
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
158
click to vote
SIGECOM
2009
ACM
15 years 11 months ago
2009
ACM
We consider the issue of representing coalitional games in multiagent systems with externalities (i.e., in systems where the performance of one coalition may be affected by other ...
131
click to vote
IPPS
2008
IEEE
2008
IEEE
Modeling and predicting application performance on parallel computers using HPC challenge benchmarks
15 years 11 months ago
A method is presented for modeling application performance on parallel computers in terms of the performance of microkernels from the HPC Challenge benchmarks. Specifically, the a...