Sciweavers

3678 search results - page 169 / 736
» On the Stable Paths Problem
Sort
View
108
Voted
GECCO
2008
Springer
110views Optimization» more  GECCO 2008»
15 years 4 months ago
Crossover can provably be useful in evolutionary computation
We show that the natural evolutionary algorithm for the all-pairs shortest path problem is significantly faster with a crossover operator than without. This is the first theoret...
Benjamin Doerr, Edda Happ, Christian Klein
116
Voted
MFCS
2007
Springer
15 years 9 months ago
Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
Paul S. Bonsma, Luis Cereceda
113
Voted
ICSOC
2005
Springer
15 years 9 months ago
Trust-Based Secure Workflow Path Construction
—Service-oriented computing promotes collaboration by defining the standards layer that allows compatibility between disparate domains. Workflows, by taking advantage of the serv...
Mine Altunay, Douglas E. Brown, Gregory T. Byrd, R...
MFCS
2000
Springer
15 years 7 months ago
On the Use of Duality and Geometry in Layouts for ATM Networks
Abstract. We show how duality properties and geometric considerations are used in studies related to virtual path layouts of ATM networks. We concentrate on the one-to-many problem...
Shmuel Zaks
133
Voted
EPIA
2005
Springer
15 years 9 months ago
Operational Semantics for DyLPs
Theoretical research has spent some years facing the problem of how to represent and provide semantics to updates of logic programs. This problem is relevant for addressing highly ...
Federico Banti, José Júlio Alferes, ...