Sciweavers

1387 search results - page 154 / 278
» Convexity in Discrete Space
Sort
View
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
14 years 7 months ago
Approximability of Robust Network Design
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
Neil Olver, F. Bruce Shepherd
ICC
2007
IEEE
14 years 4 months ago
Practical Limits of Multi-Tone Signaling Over High-Speed Backplane Electrical Links
— Application of Discrete Multi-tone (DMT) signaling to high-speed backplane interconnects requires major modifications to the well-known analysis methods applied to wireline com...
Amir Amirkhany, Ali-Azam Abbasfar, Vladimir Stojan...
COMPGEOM
2004
ACM
14 years 3 months ago
Inner and outer rounding of set operations on lattice polygonal regions
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
Olivier Devillers, Philippe Guigue
PPSN
2004
Springer
14 years 3 months ago
Multi-objective Optimisation by Co-operative Co-evolution
This paper presents the integration between a co-operative co-evolutionary genetic algorithm (CCGA) and four evolutionary multiobjective optimisation algorithms (EMOAs): a multi-ob...
Kuntinee Maneeratana, Kittipong Boonlong, Nachol C...
COMPGEOM
2003
ACM
14 years 3 months ago
Planar minimally rigid graphs and pseudo-triangulations
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...
Ruth Haas, David Orden, Günter Rote, Francisc...