Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
15,897
Automatic Derivation of Loop Termination Conditions to Support Verification
"... This paper introduces a repeatable and constructive approach to the analysis of loop progress and termination conditions in imperative programs. It is applicable to all loops for which a variant function can be defined using only loop guard variables. The approach involves the algorithmic derivation ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
This paper introduces a repeatable and constructive approach to the analysis of loop progress and termination conditions in imperative programs. It is applicable to all loops for which a variant function can be defined using only loop guard variables. The approach involves the algorithmic
Branch Prediction by Checking Loop Terminal Conditions
"... Branch prediction accuracy is a crucial parameter in determining the amount of parallelism that can be exploited. Current advanced branch prediction techniques are able to attain correct predictions in most cases. Conventionally, the profiling information is used to predict the behavior of a branch. ..."
Abstract
- Add to MetaCart
. However, they are unsuccessful in predicting specific conditions like branch loop terminations, arrays e.t.c. This hinders them from achieving full accuracy. Neural Networks have an inherent capability to analyze inputs to form meaningful relationships among them. This property of neural networks makes
The Aurora Experimental Framework for the Performance Evaluation of Speech Recognition Systems under Noisy Conditions
- in ISCA ITRW ASR2000
, 2000
"... This paper describes a database designed to evaluate the performance of speech recognition algorithms in noisy conditions. The database may either be used to measure frontend feature extraction algorithms, using a defined HMM recognition back-end, or complete recognition systems. The source speech f ..."
Abstract
-
Cited by 534 (6 self)
- Add to MetaCart
This paper describes a database designed to evaluate the performance of speech recognition algorithms in noisy conditions. The database may either be used to measure frontend feature extraction algorithms, using a defined HMM recognition back-end, or complete recognition systems. The source speech
A Maximum-Entropy-Inspired Parser
, 1999
"... We present a new parser for parsing down to Penn tree-bank style parse trees that achieves 90.1% average precision/recall for sentences of length 40 and less, and 89.5% for sentences of length 100 and less when trained and tested on the previously established [5,9,10,15,17] "stan- dard" se ..."
Abstract
-
Cited by 971 (19 self)
- Add to MetaCart
and combine many different conditioning events. We also present some partial results showing the effects of different conditioning information, including a surprising 2% improvement due to guessing the lexical head's pre-terminal before guessing the lexical head.
Software pipelining: An effective scheduling technique for VLIW machines
, 1988
"... This paper shows that software pipelining is an effective and viable scheduling technique for VLIW processors. In software pipelining, iterations of a loop in the source program are continuously initiated at constant intervals, before the preceding iterations complete. The advantage of software pipe ..."
Abstract
-
Cited by 581 (3 self)
- Add to MetaCart
hierarchical reduction scheme whereby entire control con-structs are reduced to an object similar to an operation in a basic block. With this scheme, all innermost loops, including those containing conditional statements, can be software pipelined. It also diminishes the start-up cost of loops with small
Performance Analysis of the IEEE 802.11 Distributed Coordination Function
, 2000
"... Recently, the IEEE has standardized the 802.11 protocol for Wireless Local Area Networks. The primary medium access control (MAC) technique of 802.11 is called distributed coordination function (DCF). DCF is a carrier sense multiple access with collision avoidance (CSMA/CA) scheme with binary slott ..."
Abstract
-
Cited by 1869 (1 self)
- Add to MetaCart
slotted exponential backoff. This paper provides a simple, but nevertheless extremely accurate, analytical model to compute the 802.11 DCF throughput, in the assumption of finite number of terminals and ideal channel conditions. The proposed analysis applies to both the packet transmission schemes
Macroscopic strings as heavy quarks in large N gauge theory and Anti-de Sitter supergravity
- PHYS. J. C22
"... Maldacena has put forward large N correspondence between superconformal field theories on the brane and anti-de Sitter supergravity in spacetime. We study some aspects of the correspondence between N = 4 superconformal gauge theory on D3-brane and maximal supergravity on adS5 × S5 by introducing mac ..."
Abstract
-
Cited by 508 (1 self)
- Add to MetaCart
for macroscopic string in anti-de Sitter supergravity. As a by-product we clarify how Polchinski’s Dirichlet and Neumann open string boundary conditions arise. We then study non-BPS macroscopic string anti-string pair configuration as physical realization of heavy quark Wilson loop. We obtain Q ¯ Q static
Real-Time Systems
, 2000
"... Collision avoidance is an important topic in multi-robot systems. Existing multi-robot pathfinding approaches ignore sideswipe collisions among robots (i.e., only consider the collision which two agents try to occupy the same node during the same time-step) [1, 3, 4], and allow diagonal move between ..."
Abstract
-
Cited by 602 (11 self)
- Add to MetaCart
positions for two robots, respectively. R1 and R2 are robot 1 and robot 2. (a) The initial position for two robots. (b) and (c) The dead looping condition is encountered and repeated in-between (b) and (c) infinitely as each robot makes a move that mirrors the other robot’s.
A randomized protocol for signing contracts
, 1990
"... Two parties, A and B, want to sign a contract C over a communication network. To do so, they must “simultaneously” exchange their commitments to C. Since simultaneous exchange is usually impossible in practice, protocols are needed to approximate simultaneity by exchanging partial commitments in pie ..."
Abstract
-
Cited by 599 (11 self)
- Add to MetaCart
in piece by piece manner. During such a protocol, one party or another may have a slight advantage; a “fair” protocol keeps this advantage within acceptable limits. We present a new protocol that is fair in the sense that, at any stage in its execution, the conditional probability that one party cannot
Loopy belief propagation for approximate inference: An empirical study. In:
- Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" -the use of Pearl's polytree algorithm in a Bayesian network with loops -can perform well in the context of error-correcting codes. The most dramatic instance of this is the near Shannon-limit performanc ..."
Abstract
-
Cited by 676 (15 self)
- Add to MetaCart
with a single loop • Unless all the conditional probabilities are deter ministic, belief propagation will converge. • There is an analytic expression relating the cor rect marginals to the loopy marginals. The ap proximation error is related to the convergence rate of the messages -the faster
Results 1 - 10
of
15,897
