Sciweavers

692 search results - page 10 / 139
» Why Experimentation can be better than
Sort
View
95
Voted
IICAI
2003
14 years 11 months ago
The Acyclic Bayesian Net Generator
Abstract. We present the Acyclic Bayesian Net Generator, a new approach to learn the structure of a Bayesian network using genetic algorithms. Due to the encoding mechanism, acycli...
Pankaj B. Gupta, Vicki H. Allan
ECP
1997
Springer
103views Robotics» more  ECP 1997»
15 years 1 months ago
Plan-Refinement Strategies and Search-Space Size
During the planning process, a planner may have many options for refinements to perform on the plan being developed. The planner’s efficiency depends on how it chooses which ref...
Reiko Tsuneto, Dana S. Nau, James A. Hendler
CGO
2003
IEEE
15 years 2 months ago
Improving Quasi-Dynamic Schedules through Region Slip
Modern processors perform dynamic scheduling to achieve better utilization of execution resources. A schedule created at run-time is often better than one created at compile-time ...
Francesco Spadini, Brian Fahs, Sanjay J. Patel, St...
ICDM
2008
IEEE
107views Data Mining» more  ICDM 2008»
15 years 4 months ago
Graph-Based Iterative Hybrid Feature Selection
When the number of labeled examples is limited, traditional supervised feature selection techniques often fail due to sample selection bias or unrepresentative sample problem. To ...
ErHeng Zhong, Sihong Xie, Wei Fan, Jiangtao Ren, J...
88
Voted
JCSS
2007
89views more  JCSS 2007»
14 years 9 months ago
The relative worst-order ratio applied to paging
The relative worst order ratio, a new measure for the quality of on-line algorithms, was recently defined and applied to two bin packing problems. Here, we extend the definition ...
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen