Sciweavers

1623 search results - page 221 / 325
» No Sorting
Sort
View
161
Voted
EUROPAR
2004
Springer
15 years 11 months ago
A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
Edson Norberto Cáceres, Frank K. H. A. Dehn...
GECCO
2004
Springer
145views Optimization» more  GECCO 2004»
15 years 11 months ago
Automated Extraction of Problem Structure
Most problems studied in artificial intelligence possess some form of structure, but a precise way to define such structure is so far lacking. We investigate how the notion of pr...
Anthony Bucci, Jordan B. Pollack, Edwin D. de Jong
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...
176
Voted
IFIP
2004
Springer
15 years 11 months ago
Safety assessment with AltaRica
: AIRBUS and ONERA used the AltaRica formal language and associated tools to perform safety assessments. Lessons learnt during the study of an electrical and hydraulic system are p...
Pierre Bieber, Christian Bougnol, Charles Castel, ...
151
Voted
ISAAC
2004
Springer
106views Algorithms» more  ISAAC 2004»
15 years 11 months ago
Minimum Common String Partition Problem: Hardness and Approximations
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
Avraham Goldstein, Petr Kolman, Jie Zheng