461 search results - page 41 / 93 » Practical polynomial factoring in polynomial time |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Machining time is a major performance criterion when it comes to high speed machining. CAM software can help in estimating that time for a given strategy. But in practice, CAM pro...
103
click to vote
ASPDAC
2004
ACM
15 years 3 months ago
2004
ACM
— The problem of minimizing dynamic power consumption by scaling down the supply voltage of computational elements off critical paths is widely addressed in the literature for th...
PCI
2005
Springer
15 years 3 months ago
2005
Springer
The increasing popularity of all-optical networks has led to extensive research on the routing and wavelength assignment problem, also termed as the Routing and Path Coloring probl...
DAM
2007
14 years 9 months ago
2007
It is shown that the set of hybrid one-dimensional reversible cellular automata (CA) with the periodic boundary condition is a regular set. This has several important consequences...
CAL
2002
14 years 9 months ago
2002
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...