Sciweavers

1813 search results - page 54 / 363
» Instance Pruning Techniques
Sort
View
SARA
2009
Springer
15 years 6 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
SAT
2009
Springer
111views Hardware» more  SAT 2009»
15 years 6 months ago
Restart Strategy Selection Using Machine Learning Techniques
Abstract. Restart strategies are an important factor in the performance of conflict-driven Davis Putnam style SAT solvers. Selecting a good restart strategy for a problem instance...
Shai Haim, Toby Walsh
IEEEPACT
2007
IEEE
15 years 6 months ago
A Loop Correlation Technique to Improve Performance Auditing
Performance auditing is an online optimization strategy that empirically measures the effectiveness of an optimization on a particular code region. It has the potential to greatly...
Jeremy Lau, Matthew Arnold, Michael Hind, Brad Cal...
KR
2004
Springer
15 years 5 months ago
Optimization Techniques for Retrieving Resources Described in OWL/RDF Documents: First Results
Practical description logic systems play an ever-growing role for knowledge representation and reasoning research even in distributed environments. In particular, the often-discus...
Volker Haarslev, Ralf Möller
ICFP
2001
ACM
15 years 11 months ago
A Simple Implementation Technique for Priority Search Queues
This paper presents a new implementation technique for priority search queues. This abstract data type is an amazing blend of finite maps and priority queues. Our implementation s...
Ralf Hinze