134 search results - page 16 / 27 » An Optimal Rebuilding Strategy for an Incremental Tree Probl... |
180
click to vote
ICANNGA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The use of support vector machines for multi-category problems is still an open field to research. Most of the published works use the one-against-rest strategy, but with...
143
click to vote
IFIP
2005
Springer
15 years 11 months ago
2005
Springer
In this paper we analyze the electricity portfolio problem of a big consumer in a multi-stage stochastic programming framework. Stochasticity enters the model via the uncertain spo...
152
click to vote
FLOPS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Outermost-needed rewriting/narrowing is a sound and complete optimal demand-driven strategy for the class of inductively sequential constructor systems. Its parallel exte...
148
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
149
click to vote
ISCAS
2003
IEEE
15 years 11 months ago
2003
IEEE
– The traditional way of approaching placement problems in computer-aided design (CAD) tools for analog layout is to explore an extremely large search space of feasible or unfeas...