Sciweavers

8413 search results - page 177 / 1683
» Ordering Problem Subgoals
Sort
View
EDM
2010
165views Data Mining» more  EDM 2010»
14 years 6 days ago
Using a Bayesian Knowledge Base for Hint Selection on Domain Specific Problems
A Bayesian Knowledge Base is a generalization of traditional Bayesian Networks where nodes or groups of nodes have independence. In this paper we describe a method of generating a ...
John C. Stamper, Tiffany Barnes, Marvin J. Croy
EOR
2007
87views more  EOR 2007»
13 years 10 months ago
The TV-Break Packing Problem
Instead of selling advertisement spots one by one, some French satellite channels decided in 2002 to modify their commercial offer in order to sell packages of spots. These new g...
Thierry Benoist, Eric Bourreau, Benoît Rotte...
CCE
2011
13 years 2 months ago
Time representations and mathematical models for process scheduling problems
During the last 15 years, many mathematical models have been developed in order to solve process operation scheduling problems, using discrete or continuous time representations. ...
Sylvain Mouret, Ignacio E. Grossmann, Pierre Pesti...
FOGA
2011
13 years 2 months ago
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
Greg Durrett, Frank Neumann, Una-May O'Reilly
ICTAI
2009
IEEE
14 years 5 months ago
Enhanced Inference for the Market Split Problem
Inference in constraint programming is usually based on the deductions generated by individual constraints which are then communicated to other constraints through domain filteri...
Tarik Hadzic, Eoin O'Mahony, Barry O'Sullivan, Mei...