Fastest

Fastest is a model-based testing tool that works with specifications written in the Z notation. The tool implements () the Test Template Framework… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1945-2018
020040019452017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
This paper analyzes a Question & Answer site for programmers, Stack Overflow, that dramatically improves on the utility and… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 4
  • figure 3
Is this relevant?
2011
2011
The problem of point-to-point fastest path computation in static spatial networks is extensively studied with many precomputation… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 4
  • figure 7
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Two new FPGA designs for the Advanced Encryption Standard (AES) are presented. The first is believed to be the fastest, achieving… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We consider a symmetric random walk on a connected graph, where each edge is labeled with the probability of transition between… (More)
  • table 1
  • figure 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
2004
2004
Adder is a very basic component in a central processing unit. The speed of compute becomes the most considerable condition for a… (More)
  • figure 1
  • figure 4
  • figure 3
  • figure 7
  • figure 6
Is this relevant?
Highly Cited
2003
Highly Cited
2003
New technologies and the deployment of mobile and nomadic services are driving the emergence of complex communications networks… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
This paper extends the A* methodology to shortest path problems in dynamic networks, in which arc travel times are time dependent… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The betweenness centrality index is essential in the analysis of social networks, but costly to compute. Currently, the fastest… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of… (More)
  • figure 3
  • figure 4
  • figure 6
  • figure 7
  • figure 9
Is this relevant?