Sciweavers

618 search results - page 63 / 124
» Short cycle connectivity
Sort
View
IAT
2005
IEEE
15 years 5 months ago
Dynamic Lightpath Protection in WDM optical Networks Using Ant-based Mobile Agents
In this paper, we consider the problem of dynamic lightpath protection in survivable WDM networks with single link failure model. Our work concerns in how to dynamically determine...
Son-Hong Ngo, Xiaohong Jiang, Susumu Horiguchi
WSC
1998
15 years 1 months ago
Implementing the Theory of Constraints Philosophy in Highly Reentrant Systems
A significant challenge in implementing the Theory of Constraints in the semiconductor industry is the complex and reentrant nature of the manufacturing process. Managing a constr...
Clay Rippenhagen, Shekar Krishnaswamy
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
16 years 1 days ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky
OOPSLA
2007
Springer
15 years 5 months ago
Living it up with a live programming language
A dynamic language improves programmer productivity through flexible typing, a focus on high-level programming, and by streamlining the edit-compile-debug cycle. Live languages g...
Sean McDirmid
CORR
2010
Springer
143views Education» more  CORR 2010»
14 years 11 months ago
The Complexity of Proving the Discrete Jordan Curve Theorem
The Jordan Curve Theorem (JCT) states that a simple closed curve divides the plane into exactly two connected regions. We formalize and prove the theorem in the context of grid gr...
Phuong Nguyen, Stephen Cook