Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,113,976 papers from all fields of science
Search
Sign In
Create Free Account
PATH (variable)
Known as:
PATH
, PATH (environment variable)
, $PATH
Expand
PATH is an environment variable on Unix-like operating systems, DOS, OS/2, and Microsoft Windows, specifying a set of directories where executable…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
22 relations
1260 (computer virus)
C shell
Child process
Command-line interface
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Constraint Programming for Path Planning with Uncertainty - Solving the Optimal Search Path Problem
Michael Morin
,
A. Papillon
,
Irène Abi-Zeid
,
François Laviolette
,
Claude-Guy Quimper
International Conference on Principles and…
2012
Corpus ID: 412516
The optimal search path (OSP) problem is a single-sided detection search problem where the location and the detectability of a…
Expand
2011
2011
Improved Auto-Focus Search Algorithms for CMOS Image-Sensing Module
C. J. Kuo
,
Chin-Hsun Chiu
Journal of information science and engineering
2011
Corpus ID: 479497
Digital image capturing devices currently available in the market include camera phone, webcam, and vehicle rear-view camera…
Expand
2010
2010
Moving from Logical Sharing of Guest OS to Physical Sharing of Deduplication on Virtual Machine
K. Suzaki
,
T. Yagi
,
K. Iijima
,
Anh-Quynh Nguyen
,
Cyrille Artho
,
Y. Watanebe
USENIX conference on Hot topics in security
2010
Corpus ID: 13532292
Current OSes include many logical sharing techniques (shared library, symbolic link, etc.) on memory and storage. Unfortunately…
Expand
Review
2009
Review
2009
Review of Replication Schemes for Unstructured P2P Networks
Sabu M. Thampi
,
K. C. Sekaran
arXiv.org
2009
Corpus ID: 7448027
Abstract- To improve unstructured P2P system performance, one wants to minimize the number of peers that have to be probed for…
Expand
2008
2008
Network search games with immobile hider, without a designated searcher starting point
S. Alpern
,
V. Baston
,
S. Gal
International Journal of Game Theory
2008
Corpus ID: 14285276
In the (zero-sum) search game Γ(G, x) proposed by Isaacs, the Hider picks a point H in the network G and the Searcher picks a…
Expand
2007
2007
Real-time video coding under power constraint based on H.264 codec
Li Su
,
Yan Lu
,
Feng Wu
,
Shipeng Li
,
Wen Gao
Electronic imaging
2007
Corpus ID: 18188902
In this paper, we propose a joint power-distortion optimization scheme for real-time H.264 video encoding under the power…
Expand
2006
2006
A Bidirectional Query Chord System Based on Latency-Sensitivity
Jing Wang
,
Shoubao Yang
,
Leitao Guo
International Conference on Grid and Cooperative…
2006
Corpus ID: 14939851
The key issue in structured P2P (peer to peer) is to locate resources effectively. Chord is a kind of structured P2P system based…
Expand
1998
1998
Stochastic node caching for memory-bounded search
Teruhisa Miura
,
T. Ishida
Systems and Computers in Japan
1998
Corpus ID: 14922403
Linear-space search algorithms such as IDA* (Iterative Deepening A*) cache only those nodes on the current search path, but may…
Expand
1990
1990
Optimal cooperative search in fractional cascaded data structures
R. Tamassia
,
J. Vitter
ACM Symposium on Parallelism in Algorithms and…
1990
Corpus ID: 2988236
Fractional cascading is a technique designed to allow efficient sequential search in a graph with catalogs of total sizen. The…
Expand
1986
1986
Rotational search methods for adaptive Pisarenko harmonic retrieval
D. Fuhrmann
,
Bede Liu
IEEE Transactions on Acoustics Speech and Signal…
1986
Corpus ID: 19245875
Two adaptation algorithms for adaptive Pisarenko harmonic retrieval are described. They are derived by considering the associated…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE