Sciweavers

743 search results - page 10 / 149
» Solving the Multiple-Instance Problem: A Lazy Learning Appro...
Sort
View
ML
2000
ACM
154views Machine Learning» more  ML 2000»
14 years 9 months ago
Lazy Learning of Bayesian Rules
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...
Zijian Zheng, Geoffrey I. Webb
CP
2009
Springer
14 years 7 months ago
Lazy Clause Generation Reengineered
Abstract. Lazy clause generation is a powerful hybrid approach to combinatorial optimization that combines features from SAT solving and finite domain (FD) propagation. In lazy cla...
Thibaut Feydy, Peter J. Stuckey

Publication
255views
13 years 7 months ago
Ant-Q Hyper-Heuristic Approach for solving 2-Dimensional Cutting Stock Problem
Hyper-heuristics are new approaches which aim at raising the level of abstraction when solving combinatorial optimisation problems. In this paper we introduce a new hyper-heuristi...
Imen Khamassi, Moez Hammami, Khaled Ghédira
ITS
2004
Springer
155views Multimedia» more  ITS 2004»
15 years 3 months ago
Modeling the Development of Problem Solving Skills in Chemistry with a Web-Based Tutor
This research describes a probabilistic approach for developing predictive models of how students learn problem-solving skills in general qualitative chemistry. The goal is to use ...
Ron Stevens, Amy Soller, Melanie Cooper, Marcia Sp...
EUROCAST
2007
Springer
132views Hardware» more  EUROCAST 2007»
15 years 1 months ago
Using Omnidirectional BTS and Different Evolutionary Approaches to Solve the RND Problem
RND (Radio Network Design) is an important problem in mobile telecommunications (for example in mobile/cellular telephony), being also relevant in the rising area of sensor network...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...