Sciweavers

2479 search results - page 175 / 496
» Quantum complexity theory
Sort
View
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
15 years 10 months ago
The no free lunch and realistic search algorithms
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
Yossi Borenstein, Riccardo Poli
WSC
2008
15 years 9 months ago
Queueing models for single machine manufacturing systems with interruptions
Queueing theory is a well-known method for evaluating the performance of manufacturing systems. When we want to analyze the performance of a single machine, M/M/1 queues or approx...
Kan Wu, Leon F. McGinnis, Bert Zwart
EUROGP
2007
Springer
171views Optimization» more  EUROGP 2007»
15 years 8 months ago
Geometric Particle Swarm Optimisation
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
Alberto Moraglio, Cecilia Di Chio, Riccardo Poli
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 6 months ago
Metric Structures and Probabilistic Computation
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...
Wesley Calvert
AML
2002
69views more  AML 2002»
15 years 6 months ago
Transfer principles in nonstandard intuitionistic arithmetic
Using a slight generalization, due to Palmgren, of sheaf semantics, we present a term-model construction that assigns a model to any first-order intuitionistic theory. A modificat...
J. Avigad, Jeremy Helzner