2137 search results - page 135 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
125
click to vote
ICDCS
2007
IEEE
15 years 11 months ago
2007
IEEE
Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with...
130
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
131
click to vote
GD
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Problems in simultaneous graph drawing involve the layout of several graphs on a shared vertex set. This paper describes a Graph Simultaneous Embedding Tool, GraphSET, de...
147
click to vote
EJC
2008
15 years 5 months ago
2008
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
134
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...