2800 search results - page 459 / 560 » Scaling RDF with time |
175
click to vote
FPL
2010
Springer
15 years 4 months ago
2010
Springer
One of the more popular placement algorithms for Field Programmable Gate Arrays (FPGAs) is called Simulated Annealing (SA). This algorithm tries to create a good quality placement ...
184
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—In this paper we present a methodology for the design of congestion control protocols for background data transfers that have a minimal delay impact on short TCP transfers and c...
230
click to vote
ICDCS
2012
IEEE
13 years 9 months ago
2012
IEEE
—Name-based route lookup is a key function for Named Data Networking (NDN). The NDN names are hierarchical and have variable and unbounded lengths, which are much longer than IPv...
157
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: Baum-Welch training is an expectation-maximisation algorithm for training the emission and transition probabilities of hidden Markov models in a fully automated way. I...
179
click to vote
QEST
2005
IEEE
16 years 2 days ago
2005
IEEE
iLTL is a probabilistic temporal logic that can specify properties of multiple discrete time Markov chains (DTMCs). In this paper, we describe two related tools: MarkovEstimator a...