Sciweavers

15485 search results - page 114 / 3097
» Computing Optimal Subsets
Sort
View
SOFSEM
2000
Springer
15 years 1 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
KDD
1997
ACM
122views Data Mining» more  KDD 1997»
15 years 2 months ago
Computing Optimized Rectilinear Regions for Association Rules
We address the problem of nding useful regions for two-dimensional association rules and decision trees. In a previous paper we presented ecient algorithms for computing optimiz...
Kunikazu Yoda, Takeshi Fukuda, Yasuhiko Morimoto, ...
CEC
2007
IEEE
14 years 10 months ago
Entropy-based Memetic Particle Swarm Optimization for computing periodic orbits of nonlinear mappings
— The computation of periodic orbits of nonlinear mappings is very important for studying and better understanding the dynamics of complex systems. Evolutionary algorithms have s...
Y. G. Petalas, Konstantinos E. Parsopoulos, Michae...
JACM
2002
107views more  JACM 2002»
14 years 9 months ago
Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers
In completely symmetric systems that have homogeneous nodes (hosts, computers, or processors) with identical arrival processes, an optimal static load balancing scheme does not in...
Hisao Kameda, Odile Pourtallier
SENSYS
2004
ACM
15 years 3 months ago
Power - time optimal algorithm for computing FFT over sensor networks
bstract: Power - Time Optimal Algorithm for Computing FFT over Sensor Networks Categories and Subject Descriptors C.2.1 [Network Architecture and Design] Wireless Communication, Di...
Turkmen Canli, Mark Terwilliger, Ajay K. Gupta, As...