Sciweavers

2080 search results - page 141 / 416
» Measuring empirical computational complexity
Sort
View
ICRA
2006
IEEE
120views Robotics» more  ICRA 2006»
15 years 10 months ago
Distributed Diagnosis of Coupled Mobile Robots
— Fault diagnosis of coupled mobile robots requires a large number of measurements to be communicated either between the robots or from the robots to a central diagnoser. As comp...
Matthew J. Daigle, Xenofon D. Koutsoukos, Gautam B...
CEC
2007
IEEE
15 years 8 months ago
Efficient relevance estimation and value calibration of evolutionary algorithm parameters
Calibrating the parameters of an evolutionary algorithm (EA) is a laborious task. The highly stochastic nature of an EA typically leads to a high variance of the measurements. The ...
Volker Nannen, A. E. Eiben
IJCAI
2007
15 years 5 months ago
Relevance Estimation and Value Calibration of Evolutionary Algorithm Parameters
— Calibrating the parameters of an evolutionary algorithm (EA) is a laborious task. The highly stochastic nature of an EA typically leads to a high variance of the measurements. ...
Volker Nannen, A. E. Eiben
AUTOMATICA
2005
108views more  AUTOMATICA 2005»
15 years 4 months ago
Robust optimal control of regular languages
This paper presents an algorithm for robust optimal control of regular languages under specified uncertainty bounds on the event cost parameters of the language measure that has b...
Constantino M. Lagoa, Jinbo Fu, Asok Ray
CVPR
2003
IEEE
16 years 6 months ago
Many-to-Many Graph Matching via Metric Embedding
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...
Yakov Keselman, Ali Shokoufandeh, M. Fatih Demirci...