Sciweavers

187 search results - page 31 / 38
» Benchmarking and solving dynamic constrained problems
Sort
View
CIKM
2011
Springer
13 years 9 months ago
Towards feature selection in network
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
Quanquan Gu, Jiawei Han
IROS
2006
IEEE
144views Robotics» more  IROS 2006»
15 years 3 months ago
Estimating Probability Distribution with Q-learning for Biped Gait Generation and Optimization
— A new biped gait generation and optimization method is proposed in the frame of Estimation of Distribution Algorithms (EDAs) with Q-learning method. By formulating the biped ga...
Lingyun Hu, Changjiu Zhou, Zengqi Sun
CVPR
2009
IEEE
16 years 4 months ago
A Min-Max Framework of Cascaded Classifier with Multiple Instance Learning for Computer Aided Diagnosis
The computer aided diagnosis (CAD) problems of detecting potentially diseased structures from medical images are typically distinguished by the following challenging characterist...
Dijia Wu (Rensselaer Polytechnic Institute), Jinbo...
SAC
2010
ACM
14 years 9 months ago
Efficient mapping and voltage islanding technique for energy minimization in NoC under design constraints
Voltage islanding technique in Network-on-Chip (NoC) can significantly reduce the computational energy consumption by scaling down the voltage levels of the processing elements (P...
Pavel Ghosh, Arunabha Sen
EOR
2008
75views more  EOR 2008»
14 years 9 months ago
Soft car sequencing with colors: Lower bounds and optimality proofs
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
Thierry Benoist