Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
3,537
An Adaptive Algorithm for Learning Changes in Run-Time Context Domain
"... The run-time context domain has much effect on the performance of practical corpus-based applications. Previous smoothing techniques, and class-based and similarity-based models cannot handle the dynamic status perfectly. In this paper, an adaptive learning algorithm is proposed for task adaptation ..."
Abstract
- Add to MetaCart
The run-time context domain has much effect on the performance of practical corpus-based applications. Previous smoothing techniques, and class-based and similarity-based models cannot handle the dynamic status perfectly. In this paper, an adaptive learning algorithm is proposed for task adaptation
An Efficient Context-Free Parsing Algorithm
, 1970
"... A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar top-down algorithm. It has a time bound proportional to n 3 (where n is the length of the string being parsed) in general; i ..."
Abstract
-
Cited by 798 (0 self)
- Add to MetaCart
; it has an n 2 bound for unambiguous grammars; and it runs in linear time on a large class of grammars, which seems to include most practical context-free programming language grammars. In an empirical comparison it appears to be superior to the top-down and bottom-up algorithms studied by Griffiths
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
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
Run-Time Compositional Software Platform for
"... Autonomous Robots normally perform tasks in unstructured environments, with little or no continuous human guidance. This calls for context-aware, self-adaptive software systems. This paper aims at providing a flexible adaptive middleware platform to seamlessly integrate multiple adaptation logics du ..."
Abstract
- Add to MetaCart
during the run-time. To support such an approach, a reconfigurable middleware system “ACCADA ” was designed to provide compositional adaptation. During the run-time, context knowledge is used to select the most appropriate adaptation modules so as to compose an adaptive system best-matching the current
A General Approach for Run-Time Specialization and its Application to C
, 1996
"... Specializing programs with respect to run-time invariants is an optimization technique that has shown to improve the performance of programs substantially. It allows a program to adapt to execution contexts that are valid for a limited time. Run-time specialization is being actively investigated in ..."
Abstract
-
Cited by 200 (25 self)
- Add to MetaCart
Specializing programs with respect to run-time invariants is an optimization technique that has shown to improve the performance of programs substantially. It allows a program to adapt to execution contexts that are valid for a limited time. Run-time specialization is being actively investigated
Towards Requirements Aware Systems: Run-time Resolution of Design-time Assumptions
"... Abstract—In earlier work we proposed the idea of requirements-aware systems that could introspect about the extent to which their goals were being satisfied at runtime. When combined with requirements monitoring and self adaptive capabilities, requirements awareness should help optimize goal satisfa ..."
Abstract
-
Cited by 15 (6 self)
- Add to MetaCart
satisfaction even in the presence of changing run-time context. In this paper we describe initial progress towards the realization of requirements aware systems with REAssuRE. REAssuRE focuses on explicit representation of assumptions made at design time. When such assumptions are shown not to hold, REAssu
Run-time Reconfiguration Software Platform for Autonomous Robot
- Proc of ADAMUS 2010, held in the 7th ACM International Conference on Pervasive Services, 2010
"... Autonomous Robots normally perform tasks in unstructured environments, with little or no continuous human guidance. This calls for context-aware, self-adaptive software systems. Our work aims at providing a flexible adaptive middleware platform to seamlessly integrate multiple adaptation logics duri ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
during the run-time. To support such approach, a reconfigurable middleware system – ACCADA – was designed. During the run-time, context knowledge is used to select the most appropriate adaptation modules so as to compose an adaptive system best-matching the current exogenous and endogenous conditions
Run-Time Variability for Context-Aware
"... / / The proposed framework lets developers model and manage process variability by composing base models, fragments, and variability models and by deferring binding to run time. Base models and fragments are reusable, thereby reducing the modeling effort for developing variants. // CURRENT MARKET DY ..."
Abstract
- Add to MetaCart
/ / The proposed framework lets developers model and manage process variability by composing base models, fragments, and variability models and by deferring binding to run time. Base models and fragments are reusable, thereby reducing the modeling effort for developing variants. // CURRENT MARKET
Run-time fusion of MPI calls in a parallel C++ library
"... CFL is a C++ library for MPI programmers. It uses overloading to distinguish private variables from replicated, shared variables, and automatically introduces MPI communication to keep such replicated data consistent. This paper concerns a simple but surprisingly eective technique which improves per ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
performance substantially: CFL operators are executed lazily in order to expose opportunities for run-time, context-dependent, optimisation such as message aggregation and operator fusion. We evaluate the idea in the context of a large-scale simulation of oceanic plankton ecology. The results demonstrate
Run-time Resolution of Uncertainty
"... Abstract—Requirements awareness should help optimize requirements satisfaction when factors that were uncertain at design time are resolved at runtime. We use the notion of claims to model assumptions that cannot be verified with confidence at design time. By monitoring claims at runtime, their vera ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Abstract—Requirements awareness should help optimize requirements satisfaction when factors that were uncertain at design time are resolved at runtime. We use the notion of claims to model assumptions that cannot be verified with confidence at design time. By monitoring claims at runtime
Results 1 - 10
of
3,537
