Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Fastest

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
Abstract Sentiment analysis is one of the fastest growing research areas in computer science, making it challenging to keep track… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Review
2017
Review
2017
Vehicular ad hoc networks (VANETs) have become one of the most promising and fastest growing subsets of mobile ad hoc networks… Expand
Is this relevant?
Review
2016
Review
2016
We report on the successful completion of a 2 trillion particle cosmological simulation to z=0$z=0$ run on the Piz Daint… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Review
2016
Review
2016
Superconductor digital electronics using Josephson junctions as ultrafast switches and magnetic-flux encoding of information was… Expand
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
Highly Cited
2011
Highly Cited
2011
This paper analyzes a Question & Answer site for programmers, Stack Overflow, that dramatically improves on the utility and… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 4
  • figure 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We demonstrate a multiscale pedestrian detector operating in near real time ( 6 fps on 640x480 images) with state-of-the-art… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Efficient fastest path computation in the presence of varying speed conditions on a large scale road network is an essential… Expand
  • table 1
  • figure 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We consider a symmetric random walk on a connected graph, where each edge is labeled with the probability of transition between… Expand
  • table 1
  • figure 1
  • table 2
  • figure 2
  • figure 3
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1986
Highly Cited
1986
This paper introduces the problem of finding the least expected travel time path between two nodes in a network with travel times… Expand
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 5
Is this relevant?