Sciweavers

2725 search results - page 233 / 545
» Constraint Solving for Interpolation
Sort
View
ICANN
2009
Springer
15 years 11 months ago
Constrained Learning Vector Quantization or Relaxed k-Separability
Neural networks and other sophisticated machine learning algorithms frequently miss simple solutions that can be discovered by a more constrained learning methods. Transition from ...
Marek Grochowski, Wlodzislaw Duch
CAEPIA
2009
Springer
15 years 8 months ago
Empirical Hardness for Mixed Auctions
Mixed Multi-Unit Combinatorial Auctions (MMUCAs) offer a high potential to be employed for the automated assembly of supply chains of agents. However, little is known about the fac...
Pablo Almajano, Jesús Cerquides, Juan A. Ro...
TIT
2008
102views more  TIT 2008»
15 years 7 months ago
Extremal Problems of Information Combining
Abstract--In this paper, we study moments of soft bits of binary-input symmetric-output channels and solve some extremal problems of the moments. We use these results to solve the ...
Yibo Jiang, Alexei E. Ashikhmin, Ralf Koetter, And...
ASC
2004
15 years 7 months ago
Solution to global stability of fuzzy regulators via evolutionary computation
A novel approach for solving fuzzy model-based stability problems via evolutionary computation (EC) is presented. Gain scheduling problem of a multi-model fuzzy system that satisf...
Lanka Udawatta, Keigo Watanabe, Kazuo Kiguchi, Kiy...
CP
2005
Springer
16 years 23 days ago
Speeding Up Constrained Path Solvers with a Reachability Propagator
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
Luis Quesada, Peter Van Roy, Yves Deville