Sciweavers

2030 search results - page 40 / 406
» Extremal Problems of Information Combining
Sort
View
ICPR
2008
IEEE
14 years 10 months ago
Exploiting qualitative domain knowledge for learning Bayesian network parameters with incomplete data
When a large amount of data are missing, or when multiple hidden nodes exist, learning parameters in Bayesian networks (BNs) becomes extremely difficult. This paper presents a lea...
Qiang Ji, Wenhui Liao
CEC
2010
IEEE
13 years 24 days ago
Revisiting Evolutionary Information Filtering
— Adaptive Information Filtering seeks a solution to the problem of information overload through a tailored representation of the user’s interests, called user profile, which ...
Nikolaos Nanas, Stefanos Kodovas, Manolis Vavalis
ICCAD
1999
IEEE
66views Hardware» more  ICCAD 1999»
14 years 1 months ago
Timing-safe false path removal for combinational modules
A delay abstraction of a combinational module is a compact representation of the delay information of the module, which carries effective pin-to-pin delay for each primary-input/pr...
Yuji Kukimoto, Robert K. Brayton
ANTSW
2004
Springer
14 years 2 months ago
A Comparison Between ACO Algorithms for the Set Covering Problem
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
Lucas Lessing, Irina Dumitrescu, Thomas Stütz...
ICCAD
2006
IEEE
108views Hardware» more  ICCAD 2006»
14 years 6 months ago
Soft error reduction in combinational logic using gate resizing and flipflop selection
Soft errors in logic are emerging as a significant reliability problem for VLSI designs. This paper presents novel circuit optimization techniques to mitigate soft error rates (SE...
Rajeev R. Rao, David Blaauw, Dennis Sylvester