Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “Deterministic algorithm”

A Time Deterministic Dynamic Segmentation Scheduling Algorithm

Haonan Gu, Jing Wu, Yi Guo · 2022

This paper proposed a soft real-time scheduling algorithm “time-deterministic dynamic partitioning scheduling” for multimedia tasks in embedded devices. We established a new model based on the characteristics of embedded devices. We developed a pre-scheduling mechanism to select a suitable scheduling strategy based on the actual situation of the task set in the offline cache and to rearrange the task order so as to guarantee the reliability and real-time performance of the system while having higher flexibility and stability. The mechanism also completes the tasks assigned by the system in a stable manner with high utilization.

Cited by 0

A Deterministic Algorithm for Bridging Anaphora Resolution

Yufang Hou · 2018

Previous work on bridging anaphora resolution However, such patterns only consider NPs' head nouns and hence do not fully capture the semantics of NPs. Recently, Hou (2018) created word embeddings (embeddings PP) to capture associative similarity (i.e., relatedness) between nouns by exploring the syntactic structure of noun phrases. But embeddings PP only contains word representations for nouns. In this paper, we create new word vectors by combining embeddings PP with GloVe. This new word embeddings (embeddings bridging) are a more general lexical knowledge resource for bridging and allow us to represent the meaning of an NP beyond its head easily. We therefore develop a deterministic approach for bridging anaphora resolution, which represents the semantics of an NP based on its head noun and modifications. We show that this simple approach achieves the competitive results compared to the best system in Hou et al. (2013b) which explores Markov Logic Networks to model the problem. Additionally, we further improve the results for bridging anaphora resolution reported in Hou (2018) by combining our simple deterministic approach with Hou et al. (2013b)'s best system MLN II.

Cited by 20Open access

"Eztrack": A single-vehicle deterministic tracking algorithm

Charles S. Carrano · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 2007

A variety of surveillance operations require the ability to track vehicles over a long period of time using sequences of images taken from a camera mounted on an airborne or similar platform. In order to be able to see and track a vehicle for any length of time, either a persistent surveillance imager is needed that can image wide fields of view over a long time-span or a highly maneuverable smaller field-of-view imager is needed that can follow the vehicle of interest. The algorithm described here was designed for the persistence surveillance case. In turns out that most vehicle tracking algorithms described in the literature[1,2,3,4] are designed for higher frame rates (> 5 FPS) and relatively short ground sampling distances (GSD) and resolutions ({approx} few cm to a couple tens of cm). But for our datasets, we are restricted to lower resolutions and GSD's ({ge}0.5 m) and limited frame-rates ({le}2.0 Hz). As a consequence, we designed our own simple approach in IDL which is a deterministic, motion-guided object tracker. The object tracking relies both on object features and path dynamics. The algorithm certainly has room for future improvements, but we have found it to be a useful tool in evaluating effects of frame-rate, resolution/GSD, and spectral content (eg. grayscale vs. color imaging ). A block diagram of the tracking approach is given in Figure 1. We describe each of the blocks of the diagram in the upcoming sections.

Cited by 0Open access

Deterministic tree‐type algorithm with reservation mechanism

Hiroyuki Kawano, Toshiharu Hasegawa, Shojiro Nishio · Electronics and Communications in Japan (Part I Communications) · 1993

Abstract The tree‐type algorithm has been proposed and investigated widely as a random multiple‐access communication protocol. It is a distributed algorithm but shows a stable throughput performance. Several proposals have been made, including Tsybakov's, for the tree‐type algorithm with a reservation mechanism to improve further the throughput performance. This paper proposes new TREE‐DTA with reservation mechanism, which is based on the block access method and employs the deterministic Q ‐ary tree‐type algorithm operating on the terminal addresses as the retransmission algorithm. The feature of the reservation mechanism proposed in this paper is that the realization is easy, compared to various other methods that have been proposed. To evaluate the performance of TREE‐DTA with reservation mechanism, a mathematical model is used to derive the approximate expression for the relation between the throughput and the average delay. Furthermore, the performances of TREE‐DTA with reservation mechanism are examined by a simulation experiment. The robustness to the system error and the application of the priority scheme are discussed.

Cited by 0

Graph-Based Deterministic Polynomial Algorithm for NP Problems

Lee, Changryeol · Zenodo (CERN European Organization for Nuclear Research) · 2025

The P vs NP problem asks whether every problem whose solution can be verified in polynomialtime (NP) can also be solved in polynomial time (P). In this paper, we present a proof that P =NP, demonstrating that every NP problem can be solved deterministically in polynomial time usinga graph-based algorithm. We introduce a new Computation Model that enables the simulation ofa Turing machine, and show that NP problems can be simulated efficiently within this framework.By introducing the concept of a Feasible Graph, we ensure that the simulation can be performedin polynomial time, providing a direct path to resolving the P = NP question. Our result hassignificant implications for fields such as cryptography, optimization, and artificial intelligence, whereNP-complete problems play a central role.

Cited by 0Open access

Graph-Based Deterministic Polynomial Algorithm for NP Problems

Lee, Changryeol · Zenodo (CERN European Organization for Nuclear Research) · 2026

The P versus NP problem asks whether every language verifiable in polynomial time can also be decided in deterministic polynomial time. In this paper, we present a constructive proof that P = NP via a deterministic polynomial-time algorithm based on a graph-based computation framework.We introduce a model where edges correspond to deterministic Turing machine transitions. Because these execution steps formpaths sharing the initial edge, the total number of edges is polynomially bounded due to overlapping edges across the entire certificate space. By shifting the verification focus from searching over exponential certificates to incremental edge extensions through verification of their validity, we reduce the complexity of the verification process to polynomial size.A key feature of our approach is that each extension step enforces global consistency via a local in-feasibility trimmingtool. This mechanism systematically preserves consistent NP paths to the edge under verification, ensuring the graph remains globally feasible at every stage without explicit enumeration of certificates. Both extension and trimming steps are strictly bounded by a polynomial in the input size. Consequently, our construction decides NP problems in deterministic polynomial time, providing a direct resolution to the P versus NP question.

Cited by 0Open access

Genetic algorithm with deterministic crossover for vector quantization

1999

Genetic algorithm (GA) provides high quality codebooks for vector quantization (VQ) at the cost of high running time. The crossover method is the most important choice of the algorithm. We introduce a new deterministic crossover method based on the pairwise nearest neighbor method. We show that high quality codebooks can be obtained within a few minutes instead of several hours as required by the previous GA-based methods. The method outperforms all comparative codebook generation methods in quality for the tested training sets. Ó 2000 Elsevier Science B.V. All rights reserved.

Cited by 0

An Algorithm for Comparing Deterministic Regular Tree Grammars

Byron Long · 1998

An algorithm to decide inclusion for languages defined by deterministic regular tree grammars is presented. The algorithm is shown to run in polynomial time based on the number of constructors, constructor arity, and number of non-terminals. Correctness proofs are included. 1 Regular tree grammars A regular tree grammar, G, is a grammar for constructing trees. Formally, G = (C; N;P;S) where: 1. C is a finite, non-empty set of constructors. Each constructor c n is of arity n. Constants are 0-arity constructors. 2. N is a finite, non-empty set of non-terminals where N " C = ;. 3. P is a finite set of productions of the form A ! c n (X 1 ; : : : ; X n ) where A is a non-terminal, c n is a constructor, and each X i is a non-terminal. If the constructor is a constant, then we write c 0 as a shorthand for c 0 (). 4. S is a special element of N called the start symbol. A regular tree is constructed from a regular tree grammar in the following manner: 1. If A is a non-terminal, th...

Cited by 0

Deterministic walks as an algorithm of pattern recognition

Mônica G. Campiteli, Pablo Diniz Batista, Osame Kinouchi et al. · Physical Review E · 2006

New tools for automatically finding data clusters that share statistical properties in a heterogeneous data set are imperative in pattern recognition research. Here we introduce a deterministic procedure as a tool for pattern recognition in a hierarchical way. The algorithm finds attractors of mutually close points based on the neighborhood ranking. A memory parameter mu acts as a hierarchy parameter, in which the clusters are identified. The final result of the method is a general tree that represents the nesting structure of the data in an invariant way by scale transformation.

Cited by 35

Graph-Based Deterministic Polynomial Algorithm for NP Problems

Changryeol Lee · arXiv (Cornell University) · 2025

The P versus NP problem asks whether every language verifiable in polynomial time can also be decided in deterministic polynomial time. In this paper, we present a constructive proof that P = NP via a deterministic polynomial-time algorithm based on a graph-based computation framework. We introduce a model where edges correspond to deterministic Turing machine transitions. Because these execution steps form paths sharing the initial edge, the total number of edges is polynomially bounded due to overlapping edges across the entire certificate space. By shifting the verification focus from searching over exponential certificates to incremental edge extensions through verification of their validity,we reduce the complexity of the verification process to polynomial size. A key feature of our approach is that each extension step enforces global consistency via a local in-feasibility trimming tool. This mechanism systematically preserves consistent NP paths to the edge under verification, ensuring the graph remains globally feasible at every stage without explicit enumeration of certificates. Both extension and trimming steps are strictly bounded by a polynomial in the input size. Consequently, our construction decides NP problems in deterministic polynomial time, providing a direct resolution to the P versus NP question.

Cited by 0Open access

"Mtrack 1.0": A multi-vehicle, deterministic tracking algorithm

Charles S. Carrano · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 2008

As overhead persistent surveillance sensors become more capable at acquiring wide-field image sequences for longer time-spans, the need to exploit such data becomes ever greater. A desirable use of such sensors is to be able to track all the observable vehicles while they persist in the imagery. Typically, this imagery is characterized by lower resolutions (e.g. >= 0.5 m/pixel ) and lower frame rates (e.g. {approx} few Hz). We describe our initial implementation of a multiple-vehicle tracking algorithm for overhead persistent surveillance imagery. Subsequent reports will then present results of applying this tracker to specific persistent surveillance imagery as well as algorithm improvements and extensions for dealing with wider-field imagery.

Cited by 0Open access