Sciweavers

4103 search results - page 57 / 821
» Some results on the Collatz problem
Sort
View
CEC
2009
IEEE
15 years 4 months ago
Benchmarking and solving dynamic constrained problems
— Many real-world dynamic optimisation problems have constraints, and in certain cases not only the objective function changes over time, but the constraints also change as well....
Trung Thanh Nguyen, Xin Yao
FOCS
2005
IEEE
15 years 5 months ago
The Closest Substring problem with small distances
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
Dániel Marx
GLVLSI
2002
IEEE
95views VLSI» more  GLVLSI 2002»
15 years 4 months ago
Term ordering problem on MDG
As an efficient representation of Extended Finite State Machines, Multiway Decision Graphs (MDG) are suitable for automatic hardware verification of Register Transfer Level (RTL) ...
Yi Feng, Eduard Cerny
CORR
2008
Springer
216views Education» more  CORR 2008»
14 years 12 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...
COCOA
2008
Springer
15 years 1 months ago
Computational Study on Dominating Set Problem of Planar Graphs
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
Marjan Marzban, Qian-Ping Gu, Xiaohua Jia