Sciweavers

500 search results - page 20 / 100
» A parallel quadratic programming method for dynamic optimiza...
Sort
View
HICSS
2002
IEEE
89views Biometrics» more  HICSS 2002»
15 years 4 months ago
Nash Strategies for Load Serving Entities in Dynamic Energy Multi-markets
In this paper the problem of developing bidding strategies for the participants of dynamic energy-multi markets is studied. Attention is given to strategic bidding of load serving...
Jose B. Cruz Jr., Ashkan Kian
PPSN
1998
Springer
15 years 3 months ago
Methods to Evolve Legal Phenotypes
Many optimization problems require the satisfaction of constraints in addition to their objectives. When using an evolutionary algorithm to solve such problems, these constraints c...
Tina Yu, Peter J. Bentley
TKDE
2012
245views Formal Methods» more  TKDE 2012»
13 years 1 months ago
Semi-Supervised Maximum Margin Clustering with Pairwise Constraints
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
Hong Zeng, Yiu-ming Cheung
ASIAN
1999
Springer
186views Algorithms» more  ASIAN 1999»
15 years 3 months ago
Ant Colony Optimization for the Ship Berthing Problem
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
Chia Jim Tong, Hoong Chuin Lau, Andrew Lim
ICIP
2009
IEEE
16 years 4 days ago
Optimum Kernel Function Design From Scale Space Features For Object Detection
Scale-space representation of an image is a significant way to generate features for classification. However, for a specific classification task, the entire scale-space may not be...