Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
7,345
Amortized Efficiency of List Update and Paging Rules
, 1985
"... In this article we study the amortized efficiency of the “move-to-front” and similar rules for dynamically maintaining a linear list. Under the assumption that accessing the ith element from the front of the list takes 0(i) time, we show that move-to-front is within a constant factor of optimum amo ..."
Abstract
-
Cited by 824 (8 self)
- Add to MetaCart
paging, a setting in which the access cost is not convex. The paging rule corresponding to move-to-front is the “least recently used” (LRU) replacement rule. We analyze the amortized complexity of LRU, showing that its efficiency differs from that of the offline paging rule (Belady’s MIN algorithm) by a
Formalizing Correspondence Rules for Automotive Architecture Views
"... Architecture views have long been used in software industry to systematically model complex systems by representing them from the perspective of related stakeholder concerns. However, consensus has not been reached for the architec-ture views between automotive architecture description lan-guages an ..."
Abstract
- Add to MetaCart
-guages and automotive architecture frameworks. Therefore, this paper presents the automotive architecture views based on an elaborate study of existing automotive architecture de-scription techniques. Furthermore, we propose a method to formalize correspondence rules between architecture views to enforce consistency
Carnap’s Unchanging Correspondence Rules —Summary—
"... The received view on the development of the correspondence rules in Carnap’s philos-ophy of science is that at first, Carnap assumed the explicit definability of all theoretical terms in observational terms and later weakened this assumption. In the end, he conjec-tured that all observational terms ..."
Abstract
- Add to MetaCart
The received view on the development of the correspondence rules in Carnap’s philos-ophy of science is that at first, Carnap assumed the explicit definability of all theoretical terms in observational terms and later weakened this assumption. In the end, he conjec-tured that all observational terms
Near Shannon limit error-correcting coding and decoding
, 1993
"... Abstract- This paper deals with a new class of convolutional codes called Turbo-codes, whose performances in terms of Bit Error Rate (BER) are close to the SHANNON limit. The Turbo-Code encoder is built using a parallel concatenation of two Recursive Systematic Convolutional codes and the associated ..."
Abstract
-
Cited by 1776 (6 self)
- Add to MetaCart
and the associated decoder, using a feedback decoding rule, is implemented as P pipelined identical elementary decoders. Consider a binary rate R=1/2 convolutional encoder with constraint length K and memory M=K-1. The input to the encoder at time k is a bit dk and the corresponding codeword
A distributed, developmental model of word recognition and naming
- PSYCHOLOGICAL REVIEW
, 1989
"... A parallel distributed processing model of visual word recognition and pronunciation is described. The model consists of sets of orthographic and phonological units and an interlevel of hidden units. Weights on connections between units were modified during a training phase using the back-propagatio ..."
Abstract
-
Cited by 706 (49 self)
- Add to MetaCart
, and (e) differences in performance on lexieal decision and naming tasks. The model's behavior early in the learning phase corresponds to that of children acquiring word recognition skills. Training with a smaller number of hidden units produces output characteristic of many dys-lexic readers. Naming
Semantics of Context-Free Languages
- In Mathematical Systems Theory
, 1968
"... "Meaning " may be assigned to a string in a context-free language by defining "at-tributes " of the symbols in a derivation tree for that string. The attributes can be de-fined by functions associated with each production in the grammar. This paper examines the implications of th ..."
Abstract
-
Cited by 569 (0 self)
- Add to MetaCart
of this process when some of the attributes are "synthe-sized", i.e., defined solely in terms of attributes of the descendants of the correspond-ing nonterminal symbol, while other attributes are "inherited", i.e., defined in terms of attributes of the ancestors of the nonterminal symbol
Linking Requirements To Enterprise Viewpoint Specifications Using Correspondence Rules
"... Requirements modeling has been recently introduced in the UML world with the form of a new profile called SysML. This paper explores the possibility to link concepts used to describe requirements with those of the enterprise language of RM-ODP. Some correspondence rules are proposed and illustrated ..."
Abstract
- Add to MetaCart
Requirements modeling has been recently introduced in the UML world with the form of a new profile called SysML. This paper explores the possibility to link concepts used to describe requirements with those of the enterprise language of RM-ODP. Some correspondence rules are proposed and illustrated
Fading relay channels: Performance limits and space-time signal design
- IEEE J. SELECT. AREAS COMMUN
, 2004
"... Cooperative diversity is a transmission technique where multiple terminals pool their resources to form a virtual antenna array that realizes spatial diversity gain in a distributed fashion. In this paper, we examine the basic building block of cooperative diversity systems, a simple fading relay ch ..."
Abstract
-
Cited by 445 (4 self)
- Add to MetaCart
of the paper is devoted to (distributed) space-time code design for fading relay channels operating in the AF mode. We show that the corresponding code design criteria consist of the traditional rank and determinant criteria for the case of co-located antennas as well as appropriate power control rules
Policy gradient methods for reinforcement learning with function approximation.
- In NIPS,
, 1999
"... Abstract Function approximation is essential to reinforcement learning, but the standard approach of approximating a value function and determining a policy from it has so far proven theoretically intractable. In this paper we explore an alternative approach in which the policy is explicitly repres ..."
Abstract
-
Cited by 439 (20 self)
- Add to MetaCart
output is action selection probabilities, and whose weights are the policy parameters. Let θ denote the vector of policy parameters and ρ the performance of the corresponding policy (e.g., the average reward per step). Then, in the policy gradient approach, the policy parameters are updated approximately
State Transition Analysis: A Rule-Based Intrusion Detection Approach
- IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
, 1995
"... This paper presents a new approach to representing and detecting computer penetrations in real-time. The approach, called state transition analysis, models penetrations as a series of state changes that lead from an initial secure state to a target compromised state. State transition diagrams, the g ..."
Abstract
-
Cited by 353 (19 self)
- Add to MetaCart
, the graphical representation of penetrations, identify precisely the requirements for and the compromise of a penetration and present only the critical events that must occur for the successful completion of the penetration. State transition diagrams are written to correspond to the states of an actual computer
Results 1 - 10
of
7,345
