Sciweavers

224 search results - page 30 / 45
» Experiments with Monte Carlo Othello
Sort
View
PRL
2006
139views more  PRL 2006»
14 years 9 months ago
Adaptive Hausdorff distances and dynamic clustering of symbolic interval data
This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocatio...
Francisco de A. T. de Carvalho, Renata M. C. R. de...
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
15 years 4 months ago
Articulating user preferences in many-objective problems by sampling the weighted hypervolume
The hypervolume indicator has become popular in recent years both for performance assessment and to guide the search of evolutionary multiobjective optimizers. Two critical resear...
Anne Auger, Johannes Bader, Dimo Brockhoff, Eckart...
ICSNC
2007
IEEE
15 years 4 months ago
Movement Prediction Using Bayesian Learning for Neural Networks
Nowadays, path prediction is being extensively examined for use in the context of mobile and wireless computing towards more efficient network resource management schemes. Path pr...
Sherif Akoush, Ahmed Sameh
GLVLSI
2009
IEEE
143views VLSI» more  GLVLSI 2009»
15 years 1 months ago
Unified P4 (power-performance-process-parasitic) fast optimization of a Nano-CMOS VCO
In this paper, we present the design of a P4 (Power-PerformanceProcess-Parasitic) aware voltage controlled oscillator (VCO) at nanoCMOS technologies. Through simulations, we have ...
Dhruva Ghai, Saraju P. Mohanty, Elias Kougianos
DATAMINE
1999
143views more  DATAMINE 1999»
14 years 9 months ago
Partitioning Nominal Attributes in Decision Trees
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
Don Coppersmith, Se June Hong, Jonathan R. M. Hosk...