Sciweavers

4103 search results - page 62 / 821
» Some results on the Collatz problem
Sort
View
EURODAC
1994
IEEE
186views VHDL» more  EURODAC 1994»
15 years 4 months ago
Algorithms for a switch module routing problem
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
Shashidhar Thakur, D. F. Wong, S. Muthukrishnan
STOC
2002
ACM
107views Algorithms» more  STOC 2002»
16 years 4 days ago
Quantum lower bound for the collision problem
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
Scott Aaronson
HICSS
2008
IEEE
130views Biometrics» more  HICSS 2008»
15 years 6 months ago
The Economic Production Quantity Problem with a Finite Production Rate and Fuzzy Cycle Time
Managing the inventories along with carrying out the production program is essential for many companies in the producing industry. In this paper, a fuzzy EPQ (Economic Production ...
Kaj-Mikael Björk
ICCSA
2003
Springer
15 years 5 months ago
A Comparison Study of Modern Heuristics for Solving the Partitioning Problem in Distributed Virtual Environment Systems
Fast Internet connections and the widespread use of high performance graphic cards are making Distributed Virtual Environment (DVE) systems very common nowadays. However, there are...
Pedro Morillo, Marcos Fernández, Juan M. Or...
FSTTCS
2001
Springer
15 years 4 months ago
The Directed Minimum-Degree Spanning Tree Problem
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...
Radha Krishnan, Balaji Raghavachari