Sciweavers

1725 search results - page 298 / 345
» Relaxed genetic programming
Sort
View
ESA
1995
Springer
182views Algorithms» more  ESA 1995»
15 years 1 months ago
A Geometric Approach to Betweenness
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
Benny Chor, Madhu Sudan
SDM
2008
SIAM
161views Data Mining» more  SDM 2008»
14 years 11 months ago
Efficient Maximum Margin Clustering via Cutting Plane Algorithm
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
Bin Zhao, Fei Wang, Changshui Zhang
GECCO
2010
Springer
211views Optimization» more  GECCO 2010»
14 years 11 months ago
Investigating EA solutions for approximate KKT conditions in smooth problems
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
Rupesh Tulshyan, Ramnik Arora, Kalyanmoy Deb, Joyd...
CACM
2010
179views more  CACM 2010»
14 years 10 months ago
x86-TSO: a rigorous and usable programmer's model for x86 multiprocessors
Exploiting the multiprocessors that have recently become ubiquitous requires high-performance and reliable concurrent systems code, for concurrent data structures, operating syste...
Peter Sewell, Susmit Sarkar, Scott Owens, Francesc...
COR
2010
123views more  COR 2010»
14 years 10 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...