Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,684,288 papers from all fields of science
Search
Sign In
Create Free Account
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
Create Alert
Alert
Related topics
Related topics
7 relations
Community Z Tools
Interface (Java)
LaTeX
Model-based testing
Expand
Broader (1)
Z notation
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
You Only Look Once: Unified, Real-Time Object Detection
Joseph Redmon
,
S. Divvala
,
Ross B. Girshick
,
Ali Farhadi
IEEE Conference on Computer Vision and Pattern…
2016
Corpus ID: 206594738
We present YOLO, a new approach to object detection. Prior work on object detection repurposes classifiers to perform detection…
Expand
Highly Cited
2011
Highly Cited
2011
Design lessons from the fastest q&a site in the west
L. Mamykina
,
Bella Manoim
,
Manas Mittal
,
G. Hripcsak
,
B. Hartmann
CHI
2011
Corpus ID: 8706419
This paper analyzes a Question & Answer site for programmers, Stack Overflow, that dramatically improves on the utility and…
Expand
Highly Cited
2010
Highly Cited
2010
The Fastest Pedestrian Detector in the West
Piotr Dollár
,
Serge J. Belongie
,
P. Perona
BMVC
2010
Corpus ID: 7540163
We demonstrate a multiscale pedestrian detector operating in near real time ( 6 fps on 640x480 images) with state-of-the-art…
Expand
Highly Cited
2010
Highly Cited
2010
Oxygen ion diffusivity in strained yttria stabilized zirconia: where is the fastest strain?
A. Kushima
,
B. Yildiz
2010
Corpus ID: 833786
We present the mechanism and the extent of increase in the oxygen anion diffusivity in Y2O3 stabilized ZrO2 (YSZ) under biaxial…
Expand
Highly Cited
2007
Highly Cited
2007
Adaptive Fastest Path Computation on a Road Network: A Traffic Mining Approach
Hector Gonzalez
,
Jiawei Han
,
Xiaolei Li
,
M. Myslinska
,
J. Sondag
VLDB
2007
Corpus ID: 3718272
Efficient fastest path computation in the presence of varying speed conditions on a large scale road network is an essential…
Expand
Highly Cited
2004
Highly Cited
2004
Fastest Mixing Markov Chain on a Graph
Stephen P. Boyd
,
P. Diaconis
,
Lin Xiao
SIAM Rev.
2004
Corpus ID: 5696331
We consider a symmetric random walk on a connected graph, where each edge is labeled with the probability of transition between…
Expand
Highly Cited
2003
Highly Cited
2003
Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks
Binh-Minh Bui-Xuan
,
Afonso Ferreira
,
A. Jarry
Int. J. Found. Comput. Sci.
2003
Corpus ID: 2271039
New technologies and the deployment of mobile and nomadic services are driving the emergence of complex communications networks…
Expand
Highly Cited
2001
Highly Cited
2001
SPEA2: Improving the strength pareto evolutionary algorithm
E. Zitzler
,
M. Laumanns
,
L. Thiele
2001
Corpus ID: 16584254
The Strength Pareto Evolutionary Algorithm (SPEA) (Zitzler and Thiele 1999) is a relatively recent technique for finding or…
Expand
Highly Cited
1993
Highly Cited
1993
Fastest Paths in Time-dependent Networks for Intelligent Vehicle-Highway Systems Application
D. Kaufman
,
Robert L. Smith
J. Intell. Transp. Syst.
1993
Corpus ID: 34881339
We consider the problem of individual route guidance in an Intelligent Vehicle-Highway Systems (IVHS ) environment, based on time…
Expand
Highly Cited
1986
Highly Cited
1986
The Fastest Path through a Network with Random Time-Dependent Travel Times
R. Hall
Transp. Sci.
1986
Corpus ID: 207246327
This paper introduces the problem of finding the least expected travel time path between two nodes in a network with travel times…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE