Sciweavers

1866 search results - page 98 / 374
» Robust Algorithms and Price of Robustness in Shunting Proble...
Sort
View
ATAL
2010
Springer
15 years 7 months ago
Cooperative problem solving against adversary: quantified distributed constraint satisfaction problem
In this paper, we extend the traditional formalization of a Distributed Constraint Satisfaction Problems (DisCSP) to a Quantified DisCSP. A Quantified DisCSP includes several unive...
Satomi Baba, Atsushi Iwasaki, Makoto Yokoo, Marius...
EVOW
2005
Springer
15 years 11 months ago
Assortative Mating in Genetic Algorithms for Dynamic Problems
Non-random mating seems to be the norm in nature among sexual organisms. A common mating criteria among animals is assortative mating, where individuals mate according to their phe...
Gabriela Ochoa, Christian Mädler-Kron, Ricard...
IROS
2008
IEEE
144views Robotics» more  IROS 2008»
16 years 13 days ago
Frame rate object extraction from video sequences with self organizing networks and statistical background detection
— In many computer vision related applications it is necessary to distinguish between the background of an image and the objects that are contained in it. This is a difficult pr...
Thiago C. Bellardi, Dizan Vasquez, Christian Laugi...
MICRO
1990
IEEE
147views Hardware» more  MICRO 1990»
15 years 10 months ago
Motivation and framework for using genetic algorithms for microcode compaction
Genetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorly-defined spaces by maintaining an ordered po...
Steven J. Beaty, Darrell Whitley, Gearold Johnson
CORR
2010
Springer
85views Education» more  CORR 2010»
15 years 6 months ago
A control-theoretical methodology for the scheduling problem
This paper presents a novel methodology to develop scheduling algorithms. The scheduling problem is phrased as a control problem, and control-theoretical techniques are used to de...
Carlo A. Furia, Alberto Leva, Martina Maggio, Paol...