Sciweavers

12519 search results - page 3 / 2504
» Approximation Problems Categories
Sort
View
GECCO
2010
Springer
211views Optimization» more  GECCO 2010»
13 years 6 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...
ICCS
2004
Springer
13 years 11 months ago
A Cartesian Closed Category of Approximable Concept Structures
Abstract. Infinite contexts and their corresponding lattices are of theoretical and practical interest since they may offer connections with and insights from other mathematical ...
Pascal Hitzler, Guo-Qiang Zhang
CORR
2010
Springer
95views Education» more  CORR 2010»
13 years 5 months ago
Approximation in quantale-enriched categories
Our work is a fundamental study of the notion of approximation in Q-categories and in (U, Q)-categories, for a quantale Q and the ultrafilter monad U. We introduce auxiliary, appro...
Dirk Hofmann, Pawel Waszkiewicz
PODC
2009
ACM
14 years 6 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young
ICIP
2009
IEEE
13 years 3 months ago
Category sensitive codebook construction for object category recognition
Recently, the bag of visual words based image representation is getting popular in object category recognition. Since the codebook of the bag-of-words (BOW) based image representa...
Chunjie Zhang, Jing Liu, Yi Ouyang, Qi Tian, Hanqi...