Sciweavers

4911 search results - page 362 / 983
» Tree dependence analysis
Sort
View
GLOBECOM
2008
IEEE
15 years 11 months ago
A New Upper Bound for a Binary Additive Noisy Multiple Access Channel with Feedback
— We use the idea of dependence balance [1] to obtain the first improvement over the cut-set bound for the discrete memoryless multiple access channel with noiseless feedback (M...
Ravi Tandon, Sennur Ulukus
FASE
2005
Springer
15 years 10 months ago
Modelling Parametric Contracts and the State Space of Composite Components by Graph Grammars
Modeling the dependencies between provided and required services within a software component is necessary for several reasons, such as automated component adaptation and architectu...
Ralf Reussner, Jens Happe, Annegret Habel
SCAM
2002
IEEE
15 years 10 months ago
Dynamic Slicing Object-Oriented Programs for Debugging
Dynamic program slicing is an effective technique for narrowing the errors to the relevant parts of a program when debugging. Given a slicing criterion, the dynamic slice contains...
Baowen Xu, Zhenqiang Chen, Hongji Yang
136
Voted
CSCW
1996
ACM
15 years 9 months ago
Freeflow: Mediating Between Representation and Action in Workflow Systems
In order to understand some problems associated with workflow, we set out an analysis of workflow systems, identifying a number of basic issues in the underlying technology. This ...
Paul Dourish, Jim Holmes, Allan MacLean, Pernille ...
WSC
2008
15 years 7 months ago
Mathematical programming representations for state-dependent queues
Discrete-event dynamic systems with feedback, where the behavior of the system depends on the system state, are difficult to model due to the uncertainties and dependencies of sys...
Wai Kin Chan, Lee W. Schruben