Sciweavers

2370 search results - page 228 / 474
» A Structured Set of Higher-Order Problems
Sort
View
ATAL
2006
Springer
15 years 7 months ago
Information-theoretic approaches to branching in search
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
Andrew Gilpin, Tuomas Sandholm
DAGM
2006
Springer
15 years 7 months ago
Model Selection in Kernel Methods Based on a Spectral Analysis of Label Information
Abstract. We propose a novel method for addressing the model selection problem in the context of kernel methods. In contrast to existing methods which rely on hold-out testing or t...
Mikio L. Braun, Tilman Lange, Joachim M. Buhmann
WSC
2007
15 years 6 months ago
Automatic generation of simulation models for semiconductor manufacturing
This article gives an overview of a framework for automatically generating large-scale simulation models from a domain specific problem definition data schema, here semiconductor ...
Ralph Mueller, Christos Alexopoulos, Leon F. McGin...
IJCAI
2007
15 years 5 months ago
Maximum Margin Coresets for Active and Noise Tolerant Learning
We study the problem of learning large margin halfspaces in various settings using coresets to show that coresets are a widely applicable tool for large margin learning. A large m...
Sariel Har-Peled, Dan Roth, Dav Zimak
NIPS
2008
15 years 5 months ago
Bayesian Network Score Approximation using a Metagraph Kernel
Many interesting problems, including Bayesian network structure-search, can be cast in terms of finding the optimum value of a function over the space of graphs. However, this fun...
Benjamin Yackley, Eduardo Corona, Terran Lane