Sciweavers

10493 search results - page 206 / 2099
» Dynamic Word Problems
Sort
View
CORR
2008
Springer
216views Education» more  CORR 2008»
13 years 8 months ago
Building an interpretable fuzzy rule base from data using Orthogonal Least Squares Application to a depollution problem
In many fields where human understanding plays a crucial role, such as bioprocesses, the capacity of extracting knowledge from data is of critical importance. Within this framewor...
Sébastien Destercke, Serge Guillaume, Brigi...
DAM
2010
81views more  DAM 2010»
13 years 8 months ago
The k-in-a-tree problem for graphs of girth at least k
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...
W. Liu, Nicolas Trotignon
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 8 months ago
Separable convex optimization problems with linear ascending constraints
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. An algorithm that explicitly characterizes the optimum...
Arun Padakandla, Rajesh Sundaresan
DAM
2007
100views more  DAM 2007»
13 years 8 months ago
Memory management optimization problems for integrated circuit simulators
In hardware design, it is necessary to simulate the anticipated behavior of the integrated circuit before it is actually cast in silicon. As simulation procedures are long due to ...
Timothée Bossart, Alix Munier Kordon, Franc...
SIAMJO
2008
82views more  SIAMJO 2008»
13 years 8 months ago
Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems
A first order affine scaling method and two mth order affine scaling methods for solving monotone linear complementarity problems (LCP) are presented. All three methods produce ite...
Florian A. Potra