Sciweavers

550 search results - page 68 / 110
» Decision-Theoretic Simulated Annealing
Sort
View
CVIU
2007
108views more  CVIU 2007»
13 years 9 months ago
A real-time hand tracker using variable-length Markov models of behaviour
We present a novel approach for visual tracking of structured behaviour as observed in human–computer interaction. An automatically acquired variable-length Markov model is used...
Nikolay Stefanov, Aphrodite Galata, Roger J. Hubbo...
JSS
2008
93views more  JSS 2008»
13 years 9 months ago
Search-based refactoring for software maintenance
The high cost of software maintenance could be reduced by automatically improving the design of object-oriented programs without altering their behaviour. We have constructed a so...
Mark Kent O'Keeffe, Mel Ó Cinnéide
EC
2007
167views ECommerce» more  EC 2007»
13 years 9 months ago
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
Sylvain Gelly, Sylvie Ruette, Olivier Teytaud
KES
2006
Springer
13 years 9 months ago
Scheduling Jobs on Computational Grids Using Fuzzy Particle Swarm Algorithm
Abstract. Grid computing is a computing framework to meet the growing computational demands. This paper introduces a novel approach based on Particle Swarm Optimization (PSO) for s...
Ajith Abraham, Hongbo Liu, Weishi Zhang, Tae-Gyu C...
NAR
2008
73views more  NAR 2008»
13 years 9 months ago
LocalMove: computing on-lattice fits for biopolymers
Given an input Protein Data Bank file (PDB) for a protein or RNA molecule, LocalMove is a web server that determines an on-lattice representation for the input biomolecule. The we...
Yann Ponty, R. Istrate, E. Porcelli, Peter Clote