Sciweavers

590 search results - page 45 / 118
» Debugging Program Loops Using Approximate Modeling
Sort
View
ECML
2006
Springer
15 years 1 months ago
An Efficient Approximation to Lookahead in Relational Learners
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...
Jan Struyf, Jesse Davis, C. David Page Jr.
AADEBUG
1995
Springer
15 years 1 months ago
Software Testability Measurement for Assertion Placement and Fault Localization
Software testability, the tendency for software to reveal its faults during testing, is an important issue for veri cation and quality assurance. Testability measurement can also b...
Jeffrey M. Voas
CCE
2010
14 years 7 months ago
A simple heuristic for reducing the number of scenarios in two-stage stochastic programming
In this work we address the problem of solving multiscenario optimization models that are deterministic equivalents of two-stage stochastic programs. We present a heuristic approx...
Ramkumar Karuppiah, Mariano Martín, Ignacio...
ATAL
2006
Springer
15 years 1 months ago
Multiagent simulation meets the real world
To realize large scale socially embedded systems, this paper proposes a multiagent-based participatory design that consists of steps called 1) participatory simulation, where scen...
Toru Ishida
SARA
2009
Springer
15 years 4 months ago
Some Interval Approximation Techniques for MINLP
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
Nicolas Berger, Laurent Granvilliers