Sciweavers

19 search results - page 4 / 4
» ci 2002
Sort
View
96
Voted
ICDM
2002
IEEE
143views Data Mining» more  ICDM 2002»
15 years 3 months ago
A Hybrid Approach to Discover Bayesian Networks From Databases Using Evolutionary Programming
This paper describes a novel data mining approach that employs evolutionary programming to discover knowledge represented in Bayesian networks. There are two different approaches ...
Man Leung Wong, Shing Yan Lee, Kwong-Sak Leung
85
Voted
AI
2002
Springer
14 years 10 months ago
Learning Bayesian networks from data: An information-theory based approach
This paper provides algorithms that use an information-theoretic analysis to learn Bayesian network structures from data. Based on our three-phase learning framework, we develop e...
Jie Cheng, Russell Greiner, Jonathan Kelly, David ...
93
Voted
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
14 years 10 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...
IOR
2002
135views more  IOR 2002»
14 years 10 months ago
A Fluid Heuristic for Minimizing Makespan in Job Shops
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...
J. G. Dai, Gideon Weiss