Sciweavers

531 search results - page 76 / 107
» Formal Methods for Networks on Chips
Sort
View
MOBICOM
2006
ACM
14 years 1 months ago
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...
Hannes Frey, Ivan Stojmenovic
JCB
2006
185views more  JCB 2006»
13 years 7 months ago
A Probabilistic Methodology for Integrating Knowledge and Experiments on Biological Networks
Biological systems are traditionally studied by focusing on a specific subsystem, building an intuitive model for it, and refining the model using results from carefully designed ...
Irit Gat-Viks, Amos Tanay, Daniela Raijman, Ron Sh...
CIKM
2010
Springer
13 years 5 months ago
Regularization and feature selection for networked features
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...
Hongliang Fei, Brian Quanz, Jun Huan
CSCWD
2001
Springer
14 years 1 days ago
Modeling Workflow within Distributed Systems
Workflow management techniques are aiming at supporting business process across organization boundaries. Current techniques are lacking of the formalism tools to model and analyze...
Yuhong Yan, Alex Bejan
INFORMS
1998
142views more  INFORMS 1998»
13 years 7 months ago
Distributed State Space Generation of Discrete-State Stochastic Models
High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generatio...
Gianfranco Ciardo, Joshua Gluckman, David M. Nicol