نتایج جستجو برای: temporal constraints
تعداد نتایج: 421132 فیلتر نتایج به سال:
Bayesian methods are now widely used for analysing radiocarbon dates. We find that the non-informative priors in use in the literature generate a bias towards wider date ranges which does not in general reflect substantial prior knowledge. We recommend using a prior in which the distribution of the difference between the earliest and latest dates has a uniform distribution. We show how such pri...
Previous work on ordering events in text has typically focused on local pairwise decisions, ignoring globally inconsistent labels. However, temporal ordering is the type of domain in which global constraints should be relatively easy to represent and reason over. This paper presents a framework that informs local decisions with two types of implicit global constraints: transitivity (A before B ...
The coordination of emergency responders and robots to undertake a number of tasks in disaster scenarios is a grand challenge for multi-agent systems. Central to this endeavour is the problem of forming the best teams (coalitions) of responders to perform the various tasks in the area where the disaster has struck. Moreover, these teams may have to form, disband, and reform in different areas o...
Web service composition has become the optimum technique for Service Oriented Architecture applications because it provides a way to obtain value-added services by combining several Web services. One key issue is that service composition must meet user’s deadline requirements. In this paper we focus our attention on modeling and analyzing time-related properties in service composition. A model ...
In this work we consider temporal networks, i.e. networks defined by a labeling λ assigning to each edge of an underlying graph G a set of discrete time-labels. The labels of an edge, which are natural numbers, indicate the discrete time moments at which the edge is available. We focus on path problems of temporal networks. In particular, we consider time-respecting paths, i.e. paths whose edge...
This paper addresses the problem of state duration modeling in combination with spectral subtraction and Rasta filtering to cancel both additive and convolutional noise in a text-dependent speaker verification task. The results presented in this paper suggest that temporal constraints can lead to reductions of 30 and 14% in the error rates at SNR equal to 0 and 6dB, respectively, without noise ...
Planning and Model Checking are similar in concept. They both deal with reaching a goal state from an initial state by applying specified rules that allow for the transition from one state to another. Exploring the relationship between them is an interesting new research area. We are interested in planning frameworks that combine both planning and scheduling. For that, we focus our attention on...
This paper deals with assurance of logical agent systems via runtime self-monitoring and checking. We adopt temporal-logic-based special constraints to be dynamically checked at a certain (customizable) frequency. These constraints are based upon a simple interval temporal logic particularly tailored to the agent realm, A-ILTL (‘Agent-Oriented Interval LTL’, LTL standing as customary for ‘Linea...
Three experiments are reported on the influence of different timing relations on the McGurk effect. In the first experiment, it is shown that strict temporal synchrony between auditory and visual speech stimuli is not required for the McGurk effect. Subjects were strongly influenced by the visual stimuli when the auditory stimuli lagged the visual stimuli by as much as 180 msec. In addition, a ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید