Sciweavers

753 search results - page 96 / 151
» Completing a (k - 1)-Assignment
Sort
View
STACS
2004
Springer
15 years 3 months ago
On Minimum Circular Arrangement
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
Murali K. Ganapathy, Sachin Lodha
SIGCSE
2010
ACM
150views Education» more  SIGCSE 2010»
15 years 3 months ago
Expanding the frontiers of computer science: designing a curriculum to reflect a diverse field
While the discipline of computing has evolved significantly in the past 30 years, Computer Science curricula have not as readily adapted to these changes. In response, we have rec...
Mehran Sahami, Alex Aiken, Julie Zelenski
ATS
2003
IEEE
75views Hardware» more  ATS 2003»
15 years 3 months ago
An Enhanced Test Generator for Capacitance Induced Crosstalk Delay Faults
Capacitive crosstalk can give rise to slowdown of signals that can propagate to a circuit output and create a functional error. A test generation methodology, called XGEN, was dev...
Arani Sinha, Sandeep K. Gupta, Melvin A. Breuer
HICSS
2003
IEEE
198views Biometrics» more  HICSS 2003»
15 years 3 months ago
Allocating Time and Resources in Project Management Under Uncertainty
We define and develop a solution approach for planning, scheduling and managing project efforts where there is significant uncertainty in the duration, resource requirements and o...
Mark A. Turnquist, Linda K. Nozick
ICNP
2003
IEEE
15 years 3 months ago
On the Cost-Quality Tradeoff in Topology-Aware Overlay Path Probing
Path probing is essential to maintaining an efficient overlay network topology. However, the cost of a full-scale probing is as high as ¢¤£¦¥¨§© , which is prohibitive i...
Chiping Tang, Philip K. McKinley