Sciweavers

457 search results - page 75 / 92
» A Dialectic Approach to Problem-Solving
Sort
View
CORR
2010
Springer
102views Education» more  CORR 2010»
13 years 2 months ago
Superior Exploration-Exploitation Balance with Quantum-Inspired Hadamard Walks
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-...
Sisir Koppaka, Ashish Ranjan Hota
IHI
2010
169views Healthcare» more  IHI 2010»
13 years 2 months ago
Dynamic scheduling of emergency department resources
The processes carried out in a hospital emergency department can be thought of as structures of activities that require resources in order to execute. Costs are reduced when resou...
Junchao Xiao, Leon J. Osterweil, Qing Wang
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
14 years 10 days ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel
INFORMS
1998
150views more  INFORMS 1998»
13 years 7 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
TVCG
2008
108views more  TVCG 2008»
13 years 7 months ago
Particle-based labeling: Fast point-feature labeling without obscuring other visual features
In many information visualization techniques, labels are an essential part to communicate the visualized data. To preserve the expressiveness of the visual representation, a placed...
Martin Luboschik, Heidrun Schumann, Hilko Cords