531 search results - page 95 / 107 » Formal Methods for Networks on Chips |
114
click to vote
TKDE
2012
13 years 1 days ago
2012
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
HM
2007
Springer
15 years 3 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
KI
2005
Springer
15 years 3 months ago
2005
Springer
The point algebra is a fundamental formal calculus for spatial and temporal reasoning. We present a new generalization that meets all requirements to describe dependencies on netw...
65
Voted
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
Humans and animals learn much better when the examples are not randomly presented but organized in a meaningful order which illustrates gradually more concepts, and gradually more ...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
We analyze dependencies in power law graph data (Web sample, Wikipedia sample and a preferential attachment graph) using statistical inference for multivariate regular variation. ...