700 search results - page 117 / 140 » et 2008 |
GD
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
This paper introduces two new algorithms to reduce the number of objectives in a multiobjective problem by identifying the most conflicting objectives. The proposed algorithms ar...
GECON
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. In distributed computer networks where resources are under decentralized control, selfish users will generally not work towards one common goal, such as maximizing the o...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We prove that the subset sum problem ax = x {0, 1}n (SUB) has a polynomial time computable certificate of infeasibility for all a with density at most 1/(2n), and for almost all ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...