Sciweavers

14548 search results - page 27 / 2910
» The Optimal Path-Matching Problem
Sort
View
FGCS
2000
81views more  FGCS 2000»
13 years 9 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch
FGCS
2000
90views more  FGCS 2000»
13 years 9 months ago
An ANTS heuristic for the frequency assignment problem
The problem considered in this paper consists in defining an assignment of frequencies to radio links, to be established between base stations and mobile transmitters, which minim...
Vittorio Maniezzo, Antonella Carbonaro
SIAMCO
2000
148views more  SIAMCO 2000»
13 years 9 months ago
Pontryagin's Principle For Local Solutions of Control Problems with Mixed Control-State Constraints
This paper deals with optimal control problems of semilinear parabolic equations with pointwise state constraints and coupled integral state-control constraints. We obtain necessar...
E. Casas, J. P. Raymond, H. Zidani
PPSN
2010
Springer
13 years 7 months ago
More Effective Crossover Operators for the All-Pairs Shortest Path Problem
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
Benjamin Doerr, Daniel Johannsen, Timo Kötzin...
ORL
1998
116views more  ORL 1998»
13 years 9 months ago
Heuristic solution of the multisource Weber problem as a p-median problem
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
Pierre Hansen, Nenad Mladenovic, Éric D. Ta...