Sciweavers

4047 search results - page 369 / 810
» The Discrete Basis Problem
Sort
View
SODA
2010
ACM
178views Algorithms» more  SODA 2010»
16 years 3 months ago
Tree Embeddings for Two-Edge-Connected Network Design
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
CISS
2008
IEEE
16 years 19 days ago
Optimal path planning for mobile backbone networks
— Mobile Backbone Networks are heterogeneous wireless networks in which a subset of the nodes are more capable than others. The more capable nodes are referred to as Mobile Backb...
Anand Srinivas, Eytan Modiano
COMPGEOM
2004
ACM
15 years 11 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
GECCO
2004
Springer
15 years 11 months ago
Unveiling Optimal Operating Conditions for an Epoxy Polymerization Process Using Multi-objective Evolutionary Computation
The optimization of the epoxy polymerization process involves a number of conflicting objectives and more than twenty decision parameters. In this paper, the problem is treated tr...
Kalyanmoy Deb, Kishalay Mitra, Rinku Dewri, Saptar...
PPSN
2004
Springer
15 years 11 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...