5138 search results - page 332 / 1028 » Low-Entropy Set Selection. |
139
click to vote
ISPD
1999
ACM
15 years 11 months ago
1999
ACM
One subtask in constraint-driven placement is enforcing a set of orientation constraints on the devices being placed. Such constraints are created in order to, for example, implem...
144
click to vote
ECAI
1998
Springer
15 years 11 months ago
1998
Springer
Knowledge about forced moves enables to select a small number of moves from the set of possible moves. It is very important in complex domains where search trees have a large branc...
178
click to vote
ICCAD
1997
IEEE
15 years 11 months ago
1997
IEEE
A power estimation approach is presented in which blocks of consecutive vectors are selected at random from a user-supplied realistic input vector set and the circuit is simulated...
174
click to vote
NIPS
2004
15 years 8 months ago
2004
We propose to selectively remove examples from the training set using probabilistic estimates related to editing algorithms (Devijver and Kittler, 1982). This heuristic procedure ...
177
click to vote
NIPS
2003
15 years 8 months ago
2003
We argue that K–means and deterministic annealing algorithms for geometric clustering can be derived from the more general Information Bottleneck approach. If we cluster the ide...