942 search results - page 145 / 189 » Constraints in Graph Drawing Algorithms |
ESA
2009
Springer
14 years 4 months ago
2009
Springer
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
SIGECOM
2004
ACM
14 years 3 months ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
ICIP
2000
IEEE
14 years 11 months ago
2000
IEEE
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...
CP
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
AUTOMATICA
2006
13 years 10 months ago
2006
In this paper a novel, Gibbs sampler-based algorithm is proposed for coordination of autonomous swarms. The swarm is modeled as a Markov random field (MRF) on a graph with a time-...