Sciweavers

1215 search results - page 138 / 243
» Application domain study of evolutionary algorithms in optim...
Sort
View
SIAMSC
2010
127views more  SIAMSC 2010»
15 years 4 months ago
A Nonlinear Optimization Procedure for Generalized Gaussian Quadratures
We present a new nonlinear optimization procedure for the computation of generalized Gaussian quadratures for a broad class of square integrable functions on intervals. While some ...
James Bremer, Zydrunas Gimbutas, Vladimir Rokhlin
GECCO
2007
Springer
198views Optimization» more  GECCO 2007»
16 years 13 days ago
On the design of optimisers for surface reconstruction
In many industrial applications the need for an efficient and high-quality reconstruction of free-form surfaces does exist. Surface Reconstruction – the generation of CAD models...
Tobias Wagner, Thomas Michelitsch, Alexei Sacharow
WWW
2009
ACM
16 years 7 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
PAKDD
2004
ACM
94views Data Mining» more  PAKDD 2004»
15 years 11 months ago
Towards Optimizing Conjunctive Inductive Queries
Inductive queries are queries to an inductive database that generate a set of patterns in a data mining context. Inductive querying poses new challenges to database and data mining...
Johannes Fischer, Luc De Raedt
ISBRA
2009
Springer
16 years 1 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...