Sciweavers

4679 search results - page 152 / 936
» Modeling When Connections Are the Problem
Sort
View
EOR
2006
82views more  EOR 2006»
15 years 1 months ago
Flowshop scheduling research after five decades
: All information systems have to be protected. As the number of information objects and the number of users increase the task of information system's protection becomes more ...
Jatinder N. D. Gupta, Edward F. Stafford
MOBICOM
2006
ACM
15 years 7 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
IPPS
1999
IEEE
15 years 6 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
ICCAD
2006
IEEE
107views Hardware» more  ICCAD 2006»
15 years 10 months ago
Current path analysis for electrostatic discharge protection
The electrostatic discharge (ESD) problem has become a challenging reliability issue in nanometer circuit design. High voltages resulted from ESD might cause high current densitie...
Hung-Yi Liu, Chung-Wei Lin, Szu-Jui Chou, Wei-Ting...
COMPGEOM
2004
ACM
15 years 7 months ago
The number of lines tangent to arbitrary convex polyhedra in 3D
We prove that the lines tangent to four possibly intersecting convex polyhedra in   3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
Hervé Brönnimann, Olivier Devillers, V...