Sciweavers

203 search results - page 32 / 41
» On Span Programs
Sort
View
CORR
2000
Springer
91views Education» more  CORR 2000»
13 years 9 months ago
Algorithmic Theories of Everything
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
Jürgen Schmidhuber
OOPSLA
2010
Springer
13 years 8 months ago
Instrumentation and sampling strategies for cooperative concurrency bug isolation
Fixing concurrency bugs (or crugs) is critical in modern software systems. Static analyses to find crugs such as data races and atomicity violations scale poorly, while dynamic a...
Guoliang Jin, Aditya V. Thakur, Ben Liblit, Shan L...
TON
2010
118views more  TON 2010»
13 years 8 months ago
ILP formulations for p-cycle design without candidate cycle enumeration
—The concept of p-cycle (preconfigured protection cycle) allows fast and efficient span protection in wavelength division multiplexing (WDM) mesh networks. To design p-cycles f...
Bin Wu, Kwan L. Yeung, Pin-Han Ho
OOPSLA
2005
Springer
14 years 3 months ago
Micro patterns in Java code
Micro patterns are similar to design patterns, except that micro patterns stand at a lower, closer to the implementation, level of abstraction. Micro patterns are also unique in t...
Joseph Gil, Itay Maman
DC
2010
13 years 10 months ago
A knowledge-based analysis of global function computation
Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends...
Joseph Y. Halpern, Sabina Petride