Sciweavers

982 search results - page 135 / 197
» Solving Steiner tree problems in graphs to optimality
Sort
View
116
Voted
JMLR
2010
129views more  JMLR 2010»
14 years 7 months ago
Learning Polyhedral Classifiers Using Logistic Function
In this paper we propose a new algorithm for learning polyhedral classifiers. In contrast to existing methods for learning polyhedral classifier which solve a constrained optimiza...
Naresh Manwani, P. S. Sastry
GECCO
2008
Springer
111views Optimization» more  GECCO 2008»
15 years 1 months ago
Multi-task code reuse in genetic programming
We propose a method of knowledge reuse between evolutionary processes that solve different optimization tasks. We define the method in the framework of tree-based genetic progra...
Wojciech Jaskowski, Krzysztof Krawiec, Bartosz Wie...
IPPS
2000
IEEE
15 years 4 months ago
Bandwidth-Efficient Collective Communication for Clustered Wide Area Systems
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
Thilo Kielmann, Henri E. Bal, Sergei Gorlatch
87
Voted
ICCAD
1997
IEEE
75views Hardware» more  ICCAD 1997»
15 years 4 months ago
An exact gate decomposition algorithm for low-power technology mapping
With the remarkable growth of portable application and the increasing frequency and integration density, power is being given comparable weight to speed and area in IC designs. In...
Hai Zhou, D. F. Wong
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
15 years 7 months ago
Evolutionary optimization of multistage interconnection networks performance
The paper deals with optimization of collective communications on multistage interconnection networks (MINs). In the experimental work, unidirectional MINs like Omega, Butterfly a...
Jirí Jaros