Log in

Relevant bibliographies by topics / Fpt algorithms

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Fpt algorithms'

Author: Grafiati

Published: 24 April 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Fpt algorithms.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Fpt algorithms"

1

Bykova, V. V. "FPT-algorithms on graphs of limited treewidth." Prikladnaya diskretnaya matematika, no. 16 (June 1, 2012): 65–78. http://dx.doi.org/10.17223/20710410/16/5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Karapetyan, Daniel, Andrew J. Parkes, Gregory Gutin, and Andrei Gagarin. "Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints." Journal of Artificial Intelligence Research 66 (September 5, 2019): 85–122. http://dx.doi.org/10.1613/jair.1.11339.

Full text

Abstract:

The fixed parameter tractable (FPT) approach is a powerful tool in tackling computationally hard problems. In this paper, we link FPT results to classic artificial intelligence (AI) techniques to show how they complement each other. Specifically, we consider the workflow satisfiability problem (WSP) which asks whether there exists an assignment of authorised users to the steps in a workflow specification, subject to certain constraints on the assignment. It was shown by Cohen et al. (JAIR 2014) that WSP restricted to the class of user-independent constraints (UI), covering many practical cases

APA, Harvard, Vancouver, ISO, and other styles

3

Abu-Khzam, Faisal N., Michael A. Langston, Pushkar Shanbhag, and Christopher T. Symons. "Scalable Parallel Algorithms for FPT Problems." Algorithmica 45, no. 3 (2006): 269–84. http://dx.doi.org/10.1007/s00453-006-1214-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

ESTIVILL-CASTRO, VLADIMIR, APICHAT HEEDNACRAM, and FRANCIS SURAWEERA. "FPT-ALGORITHMS FOR MINIMUM-BENDS TOURS." International Journal of Computational Geometry & Applications 21, no. 02 (2011): 189–213. http://dx.doi.org/10.1142/s0218195911003615.

Full text

Abstract:

This paper discusses the κ-BENDS TRAVELING SALESMAN PROBLEM. In this NP-complete problem, the inputs are n points in the plane and a positive integer κ, and we are asked whether we can travel in straight lines through these n points with at most κ bends. There are a number of applications where minimizing the number of bends in the tour is desirable because bends are considered very costly. We prove that this problem is fixed-parameter tractable (FPT). The proof is based on the kernelization approach. We also consider the RECTILINEAR κ-BENDS TRAVELING SALESMAN PROBLEM, which requires that the

APA, Harvard, Vancouver, ISO, and other styles

5

Iwata, Yoichi, Magnus Wahlström, and Yuichi Yoshida. "Half-integrality, LP-branching, and FPT Algorithms." SIAM Journal on Computing 45, no. 4 (2016): 1377–411. http://dx.doi.org/10.1137/140962838.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Shachnai, Hadas, and Meirav Zehavi. "A multivariate framework for weighted FPT algorithms." Journal of Computer and System Sciences 89 (November 2017): 157–89. http://dx.doi.org/10.1016/j.jcss.2017.05.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Misra, Neeldhara, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, and Somnath Sikdar. "FPT algorithms for Connected Feedback Vertex Set." Journal of Combinatorial Optimization 24, no. 2 (2011): 131–46. http://dx.doi.org/10.1007/s10878-011-9394-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Bykova, V. V. "FPT-algorithms and their classification on the basis of elasticity." Prikladnaya diskretnaya matematika, no. 12 (June 1, 2011): 40–48. http://dx.doi.org/10.17223/20710410/12/3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Baste, Julien, Lars Jaffke, Tomáš Masařík, Geevarghese Philip, and Günter Rote. "FPT Algorithms for Diverse Collections of Hitting Sets." Algorithms 12, no. 12 (2019): 254. http://dx.doi.org/10.3390/a12120254.

Full text

Abstract:

In this work, we study the d-Hitting Set and Feedback Vertex Set problems through the paradigm of finding diverse collections of r solutions of size at most k each, which has recently been introduced to the field of parameterized complexity. This paradigm is aimed at addressing the loss of important side information which typically occurs during the abstraction process that models real-world problems as computational problems. We use two measures for the diversity of such a collection: the sum of all pairwise Hamming distances, and the minimum pairwise Hamming distance. We show that both probl

APA, Harvard, Vancouver, ISO, and other styles

10

Xin, Xiao. "An FPT Algorithm for the Correlation Clustering Problem." Key Engineering Materials 474-476 (April 2011): 924–27. http://dx.doi.org/10.4028/www.scientific.net/kem.474-476.924.

Full text

Abstract:

Given an undirected graph G=(V, E) with real nonnegative weights and + or – labels on its edges, the correlation clustering problem is to partition the vertices of G into clusters to minimize the total weight of cut + edges and uncut – edges. This problem is APX-hard and has been intensively studied mainly from the viewpoint of polynomial time approximation algorithms. By way of contrast, a fixed-parameter tractable algorithm is presented that takes treewidth as the parameter, with a running time that is linear in the number of vertices of G.

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Fpt algorithms"

1

Pham, Hong Phong. "Studies on Optimal Colorful Structures in Vertex-Colored Graphs." Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLS528.

Full text

Abstract:

Dans cette thèse, nous étudions des problèmes différents de coloration maximale dans les graphes sommet-colorés. Nous nous concentrons sur la recherche des structures avec le nombre maximal possible de couleurs par des algorithmes en temps polynomial, nous donnons aussi la preuve des problèmes NP-difficiles pour des graphes spécifiques. En particulier, nous étudions d’abord le problème de l’appariement coloré maximum. Nous montrons que ce problème peut être résolu efficacement en temps polynomial. En plus, nous considérons également une version spécifique de ce problème, à savoir l’appariement

APA, Harvard, Vancouver, ISO, and other styles

2

Daligault, Jean. "Techniques combinatoires pour les algorithmes paramétrés et les noyaux, avec applications aux problèmes de multicoupe." Phd thesis, Université Montpellier II - Sciences et Techniques du Languedoc, 2011. http://tel.archives-ouvertes.fr/tel-00804206.

Full text

Abstract:

Dans cette thèse, nous abordons des problèmes NP-difficiles à l'aide de techniques combinatoires, en se focalisant sur le domaine de la complexité paramétrée. Les principaux problèmes que nous considérons sont les problèmes de Multicoupe et d'Arbre Orienté Couvrant avec Beaucoup de Feuilles. La Multicoupe est une généralisation naturelle du très classique problème de coupe, et consiste à séparer un ensemble donné de paires de sommets en supprimant le moins d'arêtes possible dans un graphe. Le problème d'Arbre Orienté Couvrant avec Beaucoup de Feuilles consiste à trouver un arbre couvrant avec

APA, Harvard, Vancouver, ISO, and other styles

3

Weber, Valentin. "Caractérisation des instances difficiles de problèmes d'optimisation NP-difficiles." Phd thesis, Université de Grenoble, 2013. http://tel.archives-ouvertes.fr/tel-00992388.

Full text

Abstract:

L'étude expérimentale d'algorithmes est un sujet crucial dans la conception de nouveaux algorithmes, puisque le contexte d'évaluation influence inévitablement la mesure de la qualité des algorithmes. Le sujet particulier qui nous intéresse dans l'étude expérimentale est la pertinence des instances choisies pour servir de base de test à l'expérimentation. Nous formalisons ce critère par la notion de "difficulté d'instance" qui dépend des performances pratiques de méthodes de résolution. Le coeur de la thèse porte sur un outil pour évaluer empiriquement la difficulté d'instance. L'approche propo

APA, Harvard, Vancouver, ISO, and other styles

4

Neves, Patrícia Silva. "Expansão estática de sistemas de transmissão de energia elétrica via FPA." Universidade Federal de Juiz de Fora (UFJF), 2017. https://repositorio.ufjf.br/jspui/handle/ufjf/6042.

Full text

Abstract:

Submitted by Geandra Rodrigues (geandrar@gmail.com) on 2017-12-22T14:54:33Z No. of bitstreams: 1 patriciasilvaneves.pdf: 1941458 bytes, checksum: 16ab3b743d0b75134d320f08de292905 (MD5)<br>Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2018-01-22T18:33:39Z (GMT) No. of bitstreams: 1 patriciasilvaneves.pdf: 1941458 bytes, checksum: 16ab3b743d0b75134d320f08de292905 (MD5)<br>Made available in DSpace on 2018-01-22T18:33:39Z (GMT). No. of bitstreams: 1 patriciasilvaneves.pdf: 1941458 bytes, checksum: 16ab3b743d0b75134d320f08de292905 (MD5) Previous issue date:

APA, Harvard, Vancouver, ISO, and other styles

5

Covanov, Svyatoslav. "Algorithmes de multiplication : complexité bilinéaire et méthodes asymptotiquement rapides." Thesis, Université de Lorraine, 2018. http://www.theses.fr/2018LORR0057/document.

Full text

Abstract:

Depuis 1960 et le résultat fondateur de Karatsuba, on sait que la complexité de la multiplication (d’entiers ou de polynômes) est sous-quadratique : étant donné un anneau R quelconque, le produit sur R[X] des polynômes a_0 + a_1 X et b_0 + b_1 X, pour tous a_0, a_1, b_0 et b_1 dans R, peut être calculé en seulement trois et non pas quatre multiplications sur R : (a_0 + a_1 X)(b_0 + b_1 X) = m_0 + (m_2 - m_0 - m_1)X + m_1 X^2, avec les trois produits m_0 = a_0b_0, m_1 = a_1b_1 et m_2 = (a_0 + a_1)(b_0 + b_1). De la même manière, l’algorithme de Strassen permet de multiplier deux matrices 2nx2n

APA, Harvard, Vancouver, ISO, and other styles

6

Rada, Miroslav. "Dvourozměrné řezné problémy." Master's thesis, Vysoká škola ekonomická v Praze, 2008. http://www.nusl.cz/ntk/nusl-4859.

Full text

Abstract:

The thesis first addresses the typology of cutting problems and their relationship to the packing problems. These are categorized (Wascher et al (2005)) according to 5 basic kriteria into the so-called "refined problem types", which is the sufficiently detailed and practical segmentation of cutting problems. The thesis deals with a selected sample of some of the most interesting algorithms from the wide range of those used to solve the cutting problems. The Viswanathan-Bagchi algorithm for the exact solution of constrainted two-dimensional orthogonal Cutting stock probléme with gillotine cuts

APA, Harvard, Vancouver, ISO, and other styles

7

Jonsson, Niclas. "Implementation and testing of an FPT-algorithm for computing the h+ heuristic." Thesis, Linköpings universitet, Artificiell intelligens och integrerade datorsystem, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-142050.

Full text

Abstract:

We have implemented and benchmarked an FPT-algorithm, that has two input parameters, k and w besides the input problem instance, which is a planing instance, in this thesis. The algorithm has an exponential running time as a function of these two parameters. The implemented algorithm computes the heuristic value h^+(s) of a state s that belongs to a state space, which originates from a strips instance. The purpose of the project was to test if the algorithm can be used to compute the heuristic function h^+, i.e. the delete-relaxation heuristic, in practice. The delete-relaxation heuristic valu

APA, Harvard, Vancouver, ISO, and other styles

8

Anglès, d'Auriac Jean-Alexandre. "Jeux de défense et ensembles tropicaux." Thesis, Paris 11, 2015. http://www.theses.fr/2015PA112235/document.

Full text

Abstract:

Le premier volet de cette thèse porte sur l'étude de graphes dont les sommets sont colorés. Nous étudions comment la recherche d'ensembles particuliers de sommets est affectée lorsqu'on ajoute la contrainte qu'ils soient tropicaux, c'est à dire contiennent au moins un sommet de chacune des couleurs.Cette contrainte additionnelle tend à fortement augmenter la complexité des problèmes. Par exemple, la recherche d'un plus petit ensemble dominant tropical, et celle d'une plus petite couverture par sommet tropicale, sont APX-complets même restreints aux chemins. La recherche du plus petit sous-grap

APA, Harvard, Vancouver, ISO, and other styles

9

Andersson, Andreas. "Spirometri med en smarttelefon : Utveckling av en app för att mäta rotationshastigheten till en spirometerprototyp för smarttelefoner." Thesis, KTH, Data- och elektroteknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-223355.

Full text

Abstract:

Målet med detta examensarbete har varit att utveckla en app med en algoritm för att mäta rotationshastigheten hos en prototyp för en spirometerlösning till en låg kostnad för smart- telefoner. En förstudie har gjorts av smarttelefoners användbarhet för att mäta hälsotillstånd och vilka alternativa lösningar och algoritmer som finns för att mäta rörelsedetektion. I detta arbete har en app med en algoritm utvecklats för att detektera rörelser och mäta rotations- hastigheten hos spirometerprototypens turbin filmad med en smarttelefonkamera. För att metoden ska fungera är det viktigt att rotations

APA, Harvard, Vancouver, ISO, and other styles

10

Sreehari, Ambuluri. "Implementations of the FFT algorithm on GPU." Thesis, Linköpings universitet, Elektroniksystem, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-91351.

Full text

Abstract:

The fast Fourier transform (FFT) plays an important role in digital signal processing (DSP) applications, and its implementation involves a large number of computations. Many DSP designers have been working on implementations of the FFT algorithms on different devices, such as central processing unit (CPU), Field programmable gate array (FPGA), and graphical processing unit (GPU), in order to accelerate the performance. We selected the GPU device for the implementations of the FFT algorithm because the hardware of GPU is designed with highly parallel structure. It consists of many hun

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Fpt algorithms"

1

Goessens, Walter. An analysis of the next-fit binpacking-algorithm: Case: gamma-distributed items. Universiteit Antwerpen, 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Goessens, Walter. Average case analysis of the performance of a modified next-fit binpacking-algorithm. Universiteit Antwerpen, 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Goessens, Walter. An analysis of the next-fit binpacking-algorithm: Case: discrete uniformly distributed items. Universiteit Antwerpen, 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Goessens, Walter. An average-case analysis of the next-fit binpacking-algorithm using Markhov-chains. Universiteit Antwerpen, 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Goessens, Walter. An analysis of the first-fit binpacking-algorithm: Case: continuous uniformly distributed items. Universiteit Antwerpen, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Goessens, Walter. An analysis of the first-fit binpacking-algorithm: Case: Erlang(1) distributed items. Universiteit Antwerpen, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Understanding the FFT: A tutorial on the algorithm & software for laymen, students, technicians & working engineers. Citrus Press, 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Pascal, Lafourcade, and SpringerLink (Online service), eds. Foundations and Practice of Security: 4th Canada-France MITACS Workshop, FPS 2011, Paris, France, May 12-13, 2011, Revised Selected Papers. Springer Berlin Heidelberg, 2012.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Parks, Thomas W., James F. Potts, and C. S. Burrus. DFT/FFT and Convolution Algorithms and Implementation. John Wiley & Sons, 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Bisseling, Rob H. Parallel Scientific Computation. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780198788348.001.0001.

Full text

Abstract:

This book explains how to use the bulk synchronous parallel (BSP) model to design and implement parallel algorithms in the areas of scientific computing and big data. Furthermore, it presents a hybrid BSP approach towards new hardware developments such as hierarchical architectures with both shared and distributed memory. The book provides a full treatment of core problems in scientific computing and big data, starting from a high-level problem description, via a sequential solution algorithm to a parallel solution algorithm and an actual parallel program written in the communication library B

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Fpt algorithms"

1

Lokshtanov, Daniel, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, and Meirav Zehavi. "FPT-approximation for FPT Problems." In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, 2021. http://dx.doi.org/10.1137/1.9781611976465.14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Shachnai, Hadas, and Meirav Zehavi. "A Multivariate Approach for Weighted FPT Algorithms." In Algorithms - ESA 2015. Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-48350-3_80.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Telle, Jan Arne, and Yngve Villanger. "FPT Algorithms for Domination in Biclique-Free Graphs." In Algorithms – ESA 2012. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33090-2_69.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Raman, Venkatesh, Saket Saurabh, and Ondřej Suchý. "An FPT Algorithm for Tree Deletion Set." In WALCOM: Algorithms and Computation. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36065-7_27.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Misra, Neeldhara, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, and Somnath Sikdar. "FPT Algorithms for Connected Feedback Vertex Set." In WALCOM: Algorithms and Computation. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11440-3_25.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Ağaoğlu Çağırıcı, Deniz, and Petr Hliněný. "Isomorphism Testing for T-graphs in FPT." In WALCOM: Algorithms and Computation. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-96731-4_20.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Díaz, Josep, and Dimitrios M. Thilikos. "Fast FPT-Algorithms for Cleaning Grids." In STACS 2006. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11672142_29.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Whidden, Chris, Robert G. Beiko, and Norbert Zeh. "Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments." In Experimental Algorithms. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13193-6_13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Kim, Eunjung, Sang-il Oum, Christophe Paul, Ignasi Sau, and Dimitrios M. Thilikos. "An FPT 2-Approximation for Tree-cut Decomposition." In Approximation and Online Algorithms. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-28684-6_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Narayanaswamy, N. S., and R. Subashini. "FPT Algorithms for Consecutive Ones Submatrix Problems." In Parameterized and Exact Computation. Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-03898-8_25.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Fpt algorithms"

1

Iwata, Yoichi, Keigo Oka, and Yuichi Yoshida. "Linear-Time FPT Algorithms via Network Flow." In Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2013. http://dx.doi.org/10.1137/1.9781611973402.127.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Wahlström, Magnus. "Half-integrality, LP-branching and FPT Algorithms." In Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2013. http://dx.doi.org/10.1137/1.9781611973402.128.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Chitnis, Rajesh, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, and Michal Pilipczuk. "Designing FPT Algorithms for Cut Problems Using Randomized Contractions." In 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2012. http://dx.doi.org/10.1109/focs.2012.29.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Fomin, Fedor V., Daniel Lokshtanov, Neeldhara Misra, and Saket Saurabh. "Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms." In 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2012. http://dx.doi.org/10.1109/focs.2012.62.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Mihhailov, Dmitri, Valery Sklyarov, Iouliia Skliarova, and Alexander Sudnitson. "Application-specific hardware accelerator for implementing recursive sorting algorithms." In 2010 International Conference on Field-Programmable Technology (FPT). IEEE, 2010. http://dx.doi.org/10.1109/fpt.2010.5681486.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Hung, Eddie, Al-Shahna Jamal, and Steven J. E. Wilton. "Maximum flow algorithms for maximum observability during FPGA debug." In 2013 International Conference on Field-Programmable Technology (FPT). IEEE, 2013. http://dx.doi.org/10.1109/fpt.2013.6718324.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Unnikrishnan, Deepak, Sandesh Gubbi Virupaksha, Lekshmi Krishnan, Lixin Gao, and Russell Tessier. "Accelerating iterative algorithms with asynchronous accumulative updates on FPGAs." In 2013 International Conference on Field-Programmable Technology (FPT). IEEE, 2013. http://dx.doi.org/10.1109/fpt.2013.6718332.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Chin, Scott Y. L., and Steven J. E. Wilton. "Memory Footprint Reduction for FPGA Routing Algorithms." In 2007 International Conference on Field-Programmable Technology. IEEE, 2007. http://dx.doi.org/10.1109/fpt.2007.4439225.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Yang, Xiaojun, Christoforos Kachris, and Manolis Katevenis. "Efficient implementation of CIOQ switches with sequential iterative matching algorithms." In 2010 International Conference on Field-Programmable Technology (FPT). IEEE, 2010. http://dx.doi.org/10.1109/fpt.2010.5681453.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Gebara, Nadeen, Jiuxi Meng, Wayne Luk, and Paolo Costa. "Scheduling Algorithms for High Performance Network Switching on FPGAs: A Survey." In 2018 International Conference on Field-Programmable Technology (FPT). IEEE, 2018. http://dx.doi.org/10.1109/fpt.2018.00033.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Fpt algorithms"

1

Cho, Nee-Hua. Equivalent Relationship of Function-level Representation and Implementation of Unified Indexing of FFT Algorithms. Portland State University Library, 2000. http://dx.doi.org/10.15760/etd.6752.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Irudayaraj, Joseph, Ze'ev Schmilovitch, Amos Mizrach, Giora Kritzman, and Chitrita DebRoy. Rapid detection of food borne pathogens and non-pathogens in fresh produce using FT-IRS and raman spectroscopy. United States Department of Agriculture, 2004. http://dx.doi.org/10.32747/2004.7587221.bard.

Full text

Abstract:

Rapid detection of pathogens and hazardous elements in fresh fruits and vegetables after harvest requires the use of advanced sensor technology at each step in the farm-to-consumer or farm-to-processing sequence. Fourier-transform infrared (FTIR) spectroscopy and the complementary Raman spectroscopy, an advanced optical technique based on light scattering will be investigated for rapid and on-site assessment of produce safety. Paving the way toward the development of this innovative methodology, specific original objectives were to (1) identify and distinguish different serotypes of Escherichi

APA, Harvard, Vancouver, ISO, and other styles

3

Anderson, Gerald L., and Kalman Peleg. Precision Cropping by Remotely Sensed Prorotype Plots and Calibration in the Complex Domain. United States Department of Agriculture, 2002. http://dx.doi.org/10.32747/2002.7585193.bard.

Full text

Abstract:

This research report describes a methodology whereby multi-spectral and hyperspectral imagery from remote sensing, is used for deriving predicted field maps of selected plant growth attributes which are required for precision cropping. A major task in precision cropping is to establish areas of the field that differ from the rest of the field and share a common characteristic. Yield distribution f maps can be prepared by yield monitors, which are available for some harvester types. Other field attributes of interest in precision cropping, e.g. soil properties, leaf Nitrate, biomass etc. are ob

APA, Harvard, Vancouver, ISO, and other styles

4

Gantzer, Clark J., Shmuel Assouline, and Stephen H. Anderson. Synchrotron CMT-measured soil physical properties influenced by soil compaction. United States Department of Agriculture, 2006. http://dx.doi.org/10.32747/2006.7587242.bard.

Full text

Abstract:

Methods to quantify soil conditions of pore connectivity, tortuosity, and pore size as altered by compaction were done. Air-dry soil cores were scanned at the GeoSoilEnviroCARS sector at the Advanced Photon Source for x-ray computed microtomography of the Argonne facility. Data was collected on the APS bending magnet Sector 13. Soil sample cores 5- by 5-mm were studied. Skeletonization algorithms in the 3DMA-Rock software of Lindquist et al. were used to extract pore structure. We have numerically investigated the spatial distribution for 6 geometrical characteristics of the pore structure of

APA, Harvard, Vancouver, ISO, and other styles

5

Over, Thomas, Riki Saito, Andrea Veilleux, et al. Estimation of Peak Discharge Quantiles for Selected Annual Exceedance Probabilities in Northeastern Illinois. Illinois Center for Transportation, 2016. http://dx.doi.org/10.36501/0197-9191/16-014.

Full text

Abstract:

This report provides two sets of equations for estimating peak discharge quantiles at annual exceedance probabilities (AEPs) of 0.50, 0.20, 0.10, 0.04, 0.02, 0.01, 0.005, and 0.002 (recurrence intervals of 2, 5, 10, 25, 50, 100, 200, and 500 years, respectively) for watersheds in Illinois based on annual maximum peak discharge data from 117 watersheds in and near northeastern Illinois. One set of equations was developed through a temporal analysis with a two-step least squares-quantile regression technique that measures the average effect of changes in the urbanization of the watersheds used i

APA, Harvard, Vancouver, ISO, and other styles

6

Ruiz, Pablo, Craig Perry, Alejando Garcia, et al. The Everglades National Park and Big Cypress National Preserve vegetation mapping project: Interim report—Northwest Coastal Everglades (Region 4), Everglades National Park (revised with costs). National Park Service, 2020. http://dx.doi.org/10.36967/nrr-2279586.

Full text

Abstract:

The Everglades National Park and Big Cypress National Preserve vegetation mapping project is part of the Comprehensive Everglades Restoration Plan (CERP). It is a cooperative effort between the South Florida Water Management District (SFWMD), the United States Army Corps of Engineers (USACE), and the National Park Service’s (NPS) Vegetation Mapping Inventory Program (VMI). The goal of this project is to produce a spatially and thematically accurate vegetation map of Everglades National Park and Big Cypress National Preserve prior to the completion of restoration efforts associated with CERP. T

APA, Harvard, Vancouver, ISO, and other styles

7

Improving quality of care in FP/RH of selected communities of Pangasinan Province: An intervention study. Population Council, 1998. http://dx.doi.org/10.31899/rh1998.1053.

Full text

Abstract:

This intervention study was designed to improve the quality of family planning (FP) services within the Integrated Family Planning and Maternal Health Program of the Pangasinan Population and Family Planning Program in the Philippines. It addresses high unmet need and studies the feasibility of enhancing quality of services by training service providers in fixed clinics and orienting outreach workers on the method of identifying women who have unmet need for FP. Four municipalities were chosen from the 47 municipalities comprising the province of Pangasinan and randomly assigned to experimenta

APA, Harvard, Vancouver, ISO, and other styles

8

Kenya: Identifying RTIs remain problematic: Prevention is essential. Population Council, 2000. http://dx.doi.org/10.31899/rh2000.1015.

Full text

Abstract:

Since 1990, the Nakuru Municipal Council (Kenya) has implemented a multifaceted program to reduce the incidence of reproductive tract infections (RTIs), especially those that are sexually transmitted, including HIV/AIDS. Staff in the Council’s five health clinics use syndromic management guidelines, based on clients’ reported symptoms and clinical signs, to identify clients with RTIs. In 1998, the Population Council conducted a study to assess the accuracy of syndromic management and determine the best ways to integrate RTI management into existing antenatal (ANC) and family planning (FP) serv

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!