Sciweavers

12950 search results - page 160 / 2590
» On Optimal Timed Strategies
Sort
View
AE
2005
Springer
15 years 9 months ago
Algorithms (X, sigma, eta): Quasi-random Mutations for Evolution Strategies
Randomization is an efficient tool for global optimization. We here define a method which keeps : – the order 0 of evolutionary algorithms (no gradient) ; – the stochastic as...
Anne Auger, Mohamed Jebalia, Olivier Teytaud
131
Voted
ATMOS
2007
163views Optimization» more  ATMOS 2007»
15 years 5 months ago
Branching Strategies to Improve Regularity of Crew Schedules in Ex-Urban Public Transit
We discuss timetables in ex-urban bus traffic that consist of many trips serviced every day together with some exceptions that do not repeat daily. Traditional optimization methods...
Ingmar Steinzen, Leena Suhl, Natalia Kliewer
111
Voted
FUIN
2006
106views more  FUIN 2006»
15 years 4 months ago
Architectural Principles and Scheduling Strategies for Computing Agent Systems
The paper introduces the formal description of a computing multi-agent system (MAS), its architecture and dynamics (sections 2
Marek Grochowski, Robert Schaefer, Maciej Smolka
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 4 months ago
The Impact of CSI and Power Allocation on Relay Channel Capacity and Cooperation Strategies
Capacity gain from transmitter and receiver cooperation are compared in a relay network where the cooperating nodes are close together. Under quasi-static channels, when all nodes...
Chris T. K. Ng, Andrea J. Goldsmith
FCT
2005
Springer
15 years 9 months ago
A Faster and Simpler 2-Approximation Algorithm for Block Sorting
Block sorting is used in connection with optical character recognition (OCR). Recent work has focused on finding good strategies which perform well in practice. Block sorting is N...
Wolfgang W. Bein, Lawrence L. Larmore, Linda Moral...