Sciweavers

2173 search results - page 377 / 435
» On the Values of Reducibility Candidates
Sort
View
AIPS
2010
15 years 2 months ago
Classical Planning in MDP Heuristics: with a Little Help from Generalization
Heuristic functions make MDP solvers practical by reducing their time and memory requirements. Some of the most effective heuristics (e.g., the FF heuristic function) first determ...
Andrey Kolobov, Mausam, Daniel S. Weld
FLAIRS
2008
15 years 2 months ago
A Backward Adjusting Strategy and Optimization of the C4.5 Parameters to Improve C4.5's Performance
In machine learning, decision trees are employed extensively in solving classification problems. In order to design a decision tree classifier two main phases are employed. The fi...
Jason R. Beck, Maria Garcia, Mingyu Zhong, Michael...
BIRD
2008
Springer
141views Bioinformatics» more  BIRD 2008»
15 years 1 months ago
Nested q-Partial Graphs for Genetic Network Inference from "Small n, Large p" Microarray Data
Abstract. Gaussian graphical models are widely used to tackle the important and challenging problem of inferring genetic regulatory networks from expression data. These models have...
Kevin Kontos, Gianluca Bontempi
DALT
2008
Springer
15 years 1 months ago
Abstracting and Verifying Strategy-Proofness for Auction Mechanisms
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...
Emmanuel M. Tadjouddine, Frank Guerin, Wamberto We...
AIIDE
2009
15 years 1 months ago
Demonstrating Automatic Content Generation in the Galactic Arms Race Video Game
In most modern video games, content (e.g. models, levels, weapons, etc.) shipped with the game is static and unchanging, or at best, randomized within a narrow set of parameters. ...
Erin J. Hastings, Ratan K. Guha, Kenneth O. Stanle...