Sciweavers

4488 search results - page 648 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
MLDM
2007
Springer
16 years 19 days ago
PE-PUC: A Graph Based PU-Learning Approach for Text Classification
This paper presents a novel solution for the problem of building text classifier using positive documents (P) and unlabeled documents (U). Here, the unlabeled documents are mixed w...
Shuang Yu, Chunping Li
GLVLSI
2003
IEEE
135views VLSI» more  GLVLSI 2003»
15 years 11 months ago
Constructing exact octagonal steiner minimal trees
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
Chris Coulston
SIAMJO
2000
74views more  SIAMJO 2000»
15 years 6 months ago
A Specialized Interior-Point Algorithm for Multicommodity Network Flows
Abstract. Despite the efficiency shown by interior-point methods in large-scale linear programming, they usually perform poorly when applied to multicommodity flow problems. The ne...
Jordi Castro
GECCO
2005
Springer
200views Optimization» more  GECCO 2005»
16 years 18 hour ago
An extension of vose's markov chain model for genetic algorithms
The paper presents an extension of Vose’s Markov chain model for genetic algorithm (GA). The model contains not only standard genetic operators such as mutation and crossover bu...
Anna Paszynska
CPHYSICS
2004
79views more  CPHYSICS 2004»
15 years 6 months ago
Hybrid kinetic-MHD simulations in general geometry
We present a hybrid kinetic-MHD model consisting of 3 species, the bulk fluid ions and electrons, and a kinetic minority hot particle species. The 3 species equations are derived ...
Charlson C. Kim, Carl R. Sovinec, Scott E. Parker