Sciweavers

3020 search results - page 190 / 604
» Optimal partition trees
Sort
View
ISSS
1997
IEEE
109views Hardware» more  ISSS 1997»
15 years 10 months ago
Reducing the Complexity of ILP Formulations for Synthesis
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases. There exists some tools that give an o...
Anne Mignotte, Olivier Peyran
HAIS
2009
Springer
15 years 4 months ago
A Three-Objective Evolutionary Approach to Generate Mamdani Fuzzy Rule-Based Systems
Abstract. In the last years, several papers have proposed to adopt multiobjective evolutionary algorithms (MOEAs) to generate Mamdani fuzzy rulebased systems with different trade-o...
Michela Antonelli, Pietro Ducange, Beatrice Lazzer...
CIMCA
2008
IEEE
16 years 1 months ago
Tree Exploration for Bayesian RL Exploration
Research in reinforcement learning has produced algorithms for optimal decision making under uncertainty that fall within two main types. The first employs a Bayesian framework, ...
Christos Dimitrakakis
SIGKDD
2000
231views more  SIGKDD 2000»
15 years 6 months ago
KDD-99 Classifier Learning Contest: LLSoft's Results Overview
Kernel Miner is a new data-mining tool based on building the optimal decision forest. The tool won second place in the KDD'99 Classifier Learning Contest, August 1999. We des...
Itzhak Levin
DM
2006
122views more  DM 2006»
15 years 6 months ago
Labeling trees with a condition at distance two
An L(h, k)-labeling of a graph G is an integer labeling of vertices of G, such that adjacent vertices have labels which differ by at least h, and vertices at distance two have lab...
Tiziana Calamoneri, Andrzej Pelc, Rossella Petresc...