Sciweavers

845 search results - page 24 / 169
» Connecting Many-Sorted Theories
Sort
View
MM
2005
ACM
101views Multimedia» more  MM 2005»
14 years 2 months ago
SmallConnection: designing of tangible communication media over networks
The concept of “SmallConnection (abbr. SC)” is creating easy to operate tangible media for communication over networks. Focusing on the scenario where two intimate people live...
Hideaki Ogawa, Noriaki Ando, Satoshi Onodera
HYBRID
2010
Springer
14 years 3 months ago
On the connections between PCTL and dynamic programming
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...
Federico Ramponi, Debasish Chatterjee, Sean Summer...
PLDI
2004
ACM
14 years 1 months ago
The set constraint/CFL reachability connection in practice
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
John Kodumal, Alexander Aiken
INFOCOM
2003
IEEE
14 years 1 months ago
A State Feedback Control Approach to Stabilizing Queues for ECN-Enabled TCP Connections
— In this paper, we present an analytical TCP model that takes into account of several issues that were ignored in the other existing models (such as those in [15], [19]), i.e., ...
Yuan Gao, Jennifer C. Hou
ECAL
2005
Springer
14 years 2 months ago
On a Quantitative Measure for Modularity Based on Information Theory
The concept of modularity appears to be crucial for many questions in the field of Artificial Life research. However, there have not been many quantitative measures for modularit...
Daniel Polani, Peter Dauscher, Thomas Uthmann