Sciweavers

2069 search results - page 189 / 414
» Linear time algorithms for Clobber
Sort
View
ISPD
1999
ACM
126views Hardware» more  ISPD 1999»
15 years 11 months ago
Partitioning by iterative deletion
Netlist partitioning is an important and well studied problem. In this paper, a linear time partitioning approach based on iterative deletion is presented. We use the partitioning...
Patrick H. Madden
ICCAD
1999
IEEE
109views Hardware» more  ICCAD 1999»
15 years 11 months ago
Transient sensitivity computation for transistor level analysis and tuning
This paper presents a general method for computing transient sensitivities using both the direct and adjoint methods in event driven controlled explicit simulation algorithms that...
Tuyen V. Nguyen, Peter O'Brien, David W. Winston
CORR
2007
Springer
173views Education» more  CORR 2007»
15 years 6 months ago
Computing modular polynomials in quasi-linear time
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Andreas Enge
BMCBI
2008
136views more  BMCBI 2008»
15 years 6 months ago
A comparison of machine learning algorithms for chemical toxicity classification using a simulated multi-scale data model
Background: Bioactivity profiling using high-throughput in vitro assays can reduce the cost and time required for toxicological screening of environmental chemicals and can also r...
Richard Judson, Fathi Elloumi, R. Woodrow Setzer, ...
IPPS
2009
IEEE
16 years 1 months ago
Multi-users scheduling in parallel systems
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
Erik Saule, Denis Trystram