Sciweavers

3333 search results - page 112 / 667
» Optimal Power-Down Strategies
Sort
View
CORR
2011
Springer
145views Education» more  CORR 2011»
14 years 11 months ago
Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
Yaroslav D. Sergeyev, Dmitri E. Kvasov
ICDM
2006
IEEE
127views Data Mining» more  ICDM 2006»
15 years 10 months ago
Optimal k-Anonymity with Flexible Generalization Schemes through Bottom-up Searching
In recent years, a major thread of research on kanonymity has focused on developing more flexible generalization schemes that produce higher-quality datasets. In this paper we in...
Tiancheng Li, Ninghui Li
SSPR
2004
Springer
15 years 10 months ago
Feature Subset Selection Using an Optimized Hill Climbing Algorithm for Handwritten Character Recognition
This paper presents an optimized Hill Climbing algorithm to select a subset of features for handwritten character recognition. The search is conducted taking into account a random ...
Carlos M. Nunes, Alceu de Souza Britto Jr., Celso ...
ICTAI
2003
IEEE
15 years 10 months ago
Engineering Optimization Using a Simple Evolutionary Algorithm
This paper presents a simple ¢¤£¦¥¨§© Evolution Strategy and three simple selection criteria to solve engineering optimization problems. This approach avoids the use of a...
Efrén Mezura-Montes, Carlos A. Coello Coell...
ALP
1997
Springer
15 years 8 months ago
Optimal Non-deterministic Functional Logic Computations
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
Sergio Antoy