Sciweavers

15073 search results - page 315 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
AAAI
1990
15 years 6 months ago
What Should Be Minimized in a Decision Tree?
In this paper, we address the issue of evaluating decision trees generated from training examples by a learning algorithm. We give a set of performance measures and show how some ...
Usama M. Fayyad, Keki B. Irani
WG
1993
Springer
15 years 8 months ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...
CIS
2006
Springer
15 years 8 months ago
A New Multi-objective Evolutionary Optimisation Algorithm: The Two-Archive Algorithm
Many Multi-Objective Evolutionary Algorithms (MOEAs) have been proposed in recent years. However, almost all MOEAs have been evaluated on problems with two to four objectives only...
Kata Praditwong, Xin Yao
IPPS
2002
IEEE
15 years 9 months ago
High-Performance Parallel and Distributed Computing for the BMI Eigenvalue Problem
The BMI Eigenvalue Problem is one of optimization problems and is to minimize the greatest eigenvalue of a bilinear matrix function. This paper proposes a parallel algorithm to co...
Kento Aida, Yoshiaki Futakata, Shinji Hara
TSP
2008
120views more  TSP 2008»
15 years 4 months ago
Distributed Average Consensus With Dithered Quantization
In this paper, we develop algorithms for distributed computation of averages of the node data over networks with bandwidth/power constraints or large volumes of data. Distributed ...
Tuncer C. Aysal, Mark Coates, Michael Rabbat