Sciweavers

2157 search results - page 283 / 432
» Binary ant algorithm
Sort
View
GLVLSI
2007
IEEE
186views VLSI» more  GLVLSI 2007»
15 years 5 months ago
Block placement to ensure channel routability
Given a set of placed blocks, we present an algorithm that minimally spaces the blocks to ensure routability under several assumptions. By performing a binary search on total widt...
Shigetoshi Nakatake, Zohreh Karimi, Taraneh Taghav...
CPC
2006
110views more  CPC 2006»
15 years 5 months ago
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
Alexander D. Scott, Gregory B. Sorkin
IJAR
2006
89views more  IJAR 2006»
15 years 5 months ago
Learning probabilistic decision graphs
Probabilistic decision graphs (PDGs) are a representation language for probability distributions based on binary decision diagrams. PDGs can encode (context-specific) independence...
Manfred Jaeger, Jens D. Nielsen, Tomi Silander
JMLR
2006
90views more  JMLR 2006»
15 years 5 months ago
Superior Guarantees for Sequential Prediction and Lossless Compression via Alphabet Decomposition
We present worst case bounds for the learning rate of a known prediction method that is based on hierarchical applications of binary context tree weighting (CTW) predictors. A heu...
Ron Begleiter, Ran El-Yaniv
DCC
2000
IEEE
15 years 4 months ago
Efficient Arithmetic on Koblitz Curves
It has become increasingly common to implement discrete-logarithm based public-key protocols on elliptic curves over finite fields. The basic operation is scalar multiplication: ta...
Jerome A. Solinas