51 search results - page 3 / 11 » Boosting Search with Variable Elimination |
SAS
2009
Springer
14 years 9 months ago
2009
Springer
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
IJON
2007
13 years 8 months ago
2007
This paper addresses the problem of variable ranking for Support Vector Regression. The relevance criteria that we proposed are based on leave-one-out bounds and some variants and...
ECAI
2004
Springer
14 years 1 months ago
2004
Springer
Recent work has shown the promise in using local-search “probes” as a basis for directing a backtracking-based refinement search. In this approach, the decision about the next...
ICDM
2008
IEEE
14 years 3 months ago
2008
IEEE
The task of aligning sequences arises in many applications. Classical dynamic programming approaches require the explicit state enumeration in the reward model. This is often impr...
ASPDAC
2005
ACM
13 years 10 months ago
2005
ACM
－ It is a hotly research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. BFL algorithm is the most effective Counterexample minim...