Sciweavers

1984 search results - page 147 / 397
» The colourful feasibility problem
Sort
View
JMLR
2008
117views more  JMLR 2008»
13 years 10 months ago
Active Learning by Spherical Subdivision
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...
Falk-Florian Henrich, Klaus Obermayer
KES
2008
Springer
13 years 10 months ago
Adventures in the Boundary between Domain-Independent Ontologies and Domain Content for CSCL
One of the main problems facing the development of ontology-aware authoring systems (OAS) is to link well-designed domain-independent knowledge (ontologies) with domain content. Su...
Seiji Isotani, Riichiro Mizoguchi
JSAC
2006
147views more  JSAC 2006»
13 years 10 months ago
Smart pay access control via incentive alignment
We use game theorectic models to show the lack of incentives in the TCP congestion avoidance algorithm and the consequential systemwide network problems. We then propose a Vickery-...
Jun Shu, Pravin Varaiya
CCE
2004
13 years 10 months ago
Tabu search algorithm for chemical process optimization
: This paper presents a meta-heuristic optimization algorithm, Tabu Search (TS), and describes how it can be used to solve a wide variety of chemical engineering problems. Modifica...
B. Lin, D. C. Miller
CCE
2004
13 years 10 months ago
Computational studies using a novel simplicial-approximation based algorithm for MINLP optimization
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
Vishal Goyal, Marianthi G. Ierapetritou