1165 search results - page 107 / 233 » Effective linear programming based placement methods |
92
Voted
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
We examine the problem of evaluating a policy in the contextual bandit setting using only observations collected during the execution of another policy. We show that policy evalua...
128
Voted
TACAS
2010
Springer
15 years 9 months ago
2010
Springer
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for ...
146
Voted
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
We present a novel framework based on hidden Markov models (HMMs) for matching feature point sets, which capture the shapes of object contours of interest. Point matching algorith...
122
click to vote
DAC
2008
ACM
16 years 3 months ago
2008
ACM
Due to recent advances in microfluidics technology, digital microfluidic biochips and their associated CAD problems have gained much attention, most of which has been devoted to d...
93
Voted
IEEECIT
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper, we propose a new scheduling method for asynchronous circuits in bundled-data implementation. The method is based on integer linear programming (ILP) which explores ...