Sciweavers

3019 search results - page 264 / 604
» Approximating the Domatic Number
Sort
View
ESANN
2001
15 years 8 months ago
Penalized least squares, model selection, convex hull classes and neural nets
We develop improved risk bounds for function estimation with models such as single hidden layer neural nets, using a penalized least squares criterion to select the size of the mod...
Gerald H. L. Cheang, Andrew R. Barron
WSC
2004
15 years 8 months ago
Efficient Simulation-Based Discrete Optimization
In many practical applications of simulation it is desirable to optimize the levels of integer or binary variables that are inputs for the simulation model. In these cases, the ob...
Seth D. Guikema, Rachel A. Davidson, Zehra Ç...
SLP
1997
89views more  SLP 1997»
15 years 7 months ago
Program Analysis via Graph Reachability
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are am...
Thomas W. Reps
IJCAI
1989
15 years 7 months ago
Maximum Entropy in Nilsson's Probabilistic Logic
Nilsson's Probabilistic Logic is a set theoretic mechanism for reasoning with uncertainty. We propose a new way of looking at the probability constraints enforced by the fram...
Thomas B. Kane
ALGORITHMICA
2010
141views more  ALGORITHMICA 2010»
15 years 6 months ago
Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
Dániel Marx, Ildikó Schlotter