Sciweavers

728 search results - page 86 / 146
» Compressing combinatorial objects
Sort
View
ML
2002
ACM
128views Machine Learning» more  ML 2002»
15 years 1 months ago
A Simple Method for Generating Additive Clustering Models with Limited Complexity
Additive clustering was originally developed within cognitive psychology to enable the development of featural models of human mental representation. The representational flexibili...
Michael D. Lee
IDEAL
2010
Springer
15 years 21 days ago
Applying Clustering Techniques to Reduce Complexity in Automated Planning Domains
Automated Planning is a very active area of research within Artificial Intelligence. Broadly this discipline deals with the methods by which an agent can independently determine t...
Luke Dicken, John Levine
109
Voted
NCA
2010
IEEE
15 years 18 days ago
Genetic algorithm-based training for semi-supervised SVM
The Support Vector Machine (SVM) is an interesting classifier with excellent power of generalization. In this paper, we consider applying the SVM to semi-supervised learning. We p...
Mathias M. Adankon, Mohamed Cheriet
WINE
2010
Springer
134views Economy» more  WINE 2010»
15 years 1 days ago
Truthful Mechanisms for Exhibitions
We consider the following combinatorial auction: Given a range space (U, R), and m bidders interested in buying only ranges in R, each bidder j declares her bid bj : R R+. We give...
George Christodoulou, Khaled M. Elbassioni, Mahmou...
151
Voted
CORR
2011
Springer
159views Education» more  CORR 2011»
14 years 9 months ago
Multicriteria Steiner Tree Problem for Communication Network
Abstract—This paper addresses combinatorial optimization schemes for solving the multicriteria Steiner tree problem for communication network topology design (e.g., wireless mesh...
Mark Sh. Levin, Rustem I. Nuriakhmetov