3122 search results - page 278 / 625 » A Theory of Network Equivalence |
155
click to vote
DATE
2004
IEEE
15 years 10 months ago
2004
IEEE
We lay a foundation for modeling and validation of asynchronous designs in a multi-clock synchronous programming model. This allows us to study properties of globally asynchronous...
166
click to vote
ISMIS
2000
Springer
15 years 10 months ago
2000
Springer
There is current interest in generalizing Bayesian networks by using dependencies which are more general than probabilistic conditional independence (CI). Contextual dependencies, ...
172
click to vote
ANTSW
2008
Springer
15 years 8 months ago
2008
Springer
We implement a self-organized flocking behavior in a group of mobile robots and analyze its transition from an aligned state to an unaligned state. We briefly describe the robot an...
163
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
151
click to vote
CIIT
2007
15 years 8 months ago
2007
Given a list of filtering rules with individual hitting probabilities, it is known that the average processing time of a linear-search based firewall can be minimized by searchi...