3208 search results - page 503 / 642 » A Lower Bound for Primality |
148
click to vote
ASPDAC
2005
ACM
16 years 2 days ago
2005
ACM
- Many high-level description languages, such as C/C++ or Java, lack the capability to specify the bitwidth information for variables and operations. Synthesis from these specifica...
229
click to vote
ISPD
2005
ACM
16 years 2 days ago
2005
ACM
In this paper we introduce the concept of zero-change transformations to quantify the suboptimality of existing placers. Given a netlist and its placement from a placer, we formal...
158
click to vote
SAC
2005
ACM
16 years 1 days ago
2005
ACM
This paper presents an efficient technique for placement and routing of sensors/actuators and processing units in a grid network. Our system requires an extremely high level of ro...
160
click to vote
AP2PC
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. The research in the paper is motivated by building a decentralized/P2P XML storage on top of a DHT (Distributed Hash Table). The storage must provide high data availabili...
158
click to vote
APPROX
2005
Springer
16 years 1 days ago
2005
Springer
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...