Sciweavers

8094 search results - page 184 / 1619
» Improvements in Formula Generalization
Sort
View
LICS
2007
IEEE
15 years 4 months ago
Separating DAG-Like and Tree-Like Proof Systems
We show that tree-like (Gentzen’s calculus) PK where all cut formulas have depth at most a constant d does not simulate cut-free PK. Generally, we exhibit a family of sequents t...
Phuong Nguyen
NETCOOP
2007
Springer
15 years 4 months ago
Tracing an Optical Buffer's Performance: An Effective Approach
Abstract. Optical Burst Switching proposes a future-proof alternative to the current electronic switching in the backbone. The involved optical buffers are implemented with a set o...
Wouter Rogiest, Dieter Fiems, Koenraad Laevens, He...
SOFSEM
2007
Springer
15 years 4 months ago
On Optimal Solutions for the Bottleneck Tower of Hanoi Problem
We study two aspects of a generalization of the Tower of Hanoi puzzle. In 1981, D. Wood suggested its variant, where a bigger disk may be placed higher than a smaller one if their ...
Yefim Dinitz, Shay Solomon
QEST
2006
IEEE
15 years 4 months ago
On Single-Class Load-Dependent Normalizing Constant Equations
Normalizing constant recurrence equations play an important role in the exact analysis of load-independent (LI) product-form queueing networks. However, they have not been extende...
Giuliano Casale
74
Voted
SPLC
2008
15 years 21 hour ago
Formal Modeling for Product Families Engineering
In this paper we propose a behavioural model, namely the Generalized Extended Modal Transition Systems, as a basis for the formalization of different notions of variability usuall...
Alessandro Fantechi, Stefania Gnesi