Sciweavers

1051 search results - page 25 / 211
» Single Run Optimization Using the Reverse-Simulation Method
Sort
View
ICCAD
1997
IEEE
121views Hardware» more  ICCAD 1997»
15 years 6 months ago
Adaptive methods for netlist partitioning
An algorithm that remains in use at the core of many partitioning systems is the Kernighan-Lin algorithm and a variant the Fidducia-Matheysses (FM) algorithm. To understand the FM...
Wray L. Buntine, Lixin Su, A. Richard Newton, Andr...
CP
2004
Springer
15 years 7 months ago
A Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
John N. Hooker
PAKDD
2001
ACM
104views Data Mining» more  PAKDD 2001»
15 years 6 months ago
Optimizing the Induction of Alternating Decision Trees
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...
Bernhard Pfahringer, Geoffrey Holmes, Richard Kirk...
AAAI
2010
15 years 3 months ago
A Single-Step Maximum A Posteriori Update for Bearing-Only SLAM
This paper presents a novel recursive maximum a posteriori update for the Kalman formulation of undelayed bearing-only SLAM. The estimation update step is cast as an optimization ...
Stephen Tully, George Kantor, Howie Choset
JMLR
2010
151views more  JMLR 2010»
14 years 9 months ago
The Feature Selection Path in Kernel Methods
The problem of automatic feature selection/weighting in kernel methods is examined. We work on a formulation that optimizes both the weights of features and the parameters of the ...
Fuxin Li, Cristian Sminchisescu