Sciweavers

754 search results - page 112 / 151
» Exact Algorithms for the Vertex Separator Problem in Graphs
Sort
View
SIAMSC
2008
182views more  SIAMSC 2008»
13 years 8 months ago
A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
Pratik Biswas, Kim-Chuan Toh, Yinyu Ye
ATAL
2010
Springer
13 years 9 months ago
Path disruption games
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
Yoram Bachrach, Ely Porat
DGCI
2009
Springer
13 years 11 months ago
Optimal Partial Tiling of Manhattan Polyominoes
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
Olivier Bodini, Jérémie Lumbroso
PPSN
1998
Springer
14 years 21 days ago
A Spatial Predator-Prey Approach to Multi-objective Optimization: A Preliminary Study
This paper presents a novel evolutionary approach of approximating the shape of the Pareto-optimal set of multi-objective optimization problems. The evolutionary algorithm (EA) use...
Marco Laumanns, Günter Rudolph, Hans-Paul Sch...
IJAR
2008
83views more  IJAR 2008»
13 years 8 months ago
Decision-theoretic specification of credal networks: A unified language for uncertain modeling with sets of Bayesian networks
Credal networks are models that extend Bayesian nets to deal with imprecision in probability, and can actually be regarded as sets of Bayesian nets. Credal nets appear to be power...
Alessandro Antonucci, Marco Zaffalon