P systems with branch and bound for solving two hard graph problems. | 0 | 0.34 | 2020 |
An Asynchronous P System Using Branch and Bound for Minimum Graph Coloring | 0 | 0.34 | 2019 |
An Asynchronous P System with Branch and Bound for Solving Hamiltonian Cycle Problem | 0 | 0.34 | 2019 |
Strawberry Optimization for Multi-Objective Knapsack Problem | 0 | 0.34 | 2019 |
Introduction to APDCM 2018. | 0 | 0.34 | 2018 |
An asynchronous P system with branch and bound for solving the satisfiability problem. | 0 | 0.34 | 2018 |
A Firefly Optimization For A Connected Dominating Set In A Sensor Network | 0 | 0.34 | 2017 |
Preface: Special Issue on Workshop on Advances in Parallel and Distributed Computational Models 2015. | 0 | 0.34 | 2017 |
An Asynchronous P System Using Branch and Bound for the Satisfiability Problem | 0 | 0.34 | 2017 |
An Asynchronous P System For Max-Sat | 0 | 0.34 | 2016 |
Solving Subset Sum Problem Using EN P System with Active Membranes. | 0 | 0.34 | 2016 |
On TSV array defect detection method using two ring-oscillators considering signal transitions at adjacent TSVs | 0 | 0.34 | 2015 |
Asynchronous P Systems for a Compare-and-Exchange Operation and Sorting. | 0 | 0.34 | 2015 |
Special Issue on Workshop on Advances in Parallel and Distributed Computational Models 2014. | 0 | 0.34 | 2015 |
APDCM Introduction and Committees | 0 | 0.34 | 2014 |
Asynchronous P systems for hard graph problems. | 2 | 0.39 | 2014 |
Asynchronous P Systems for the Maximum Independent Set and Related Graph Problems | 0 | 0.34 | 2013 |
Centralized Algorithms for the Connected Target Coverage in Wireless Sensor Networks | 1 | 0.41 | 2012 |
Asynchronous SN P Systems for Sorting | 0 | 0.34 | 2012 |
Asynchronous P Systems for Graph Coloring Problems | 0 | 0.34 | 2012 |
Arithmetic Operations and Factorization using Asynchronous P Systems. | 1 | 0.36 | 2012 |
Solving Sat And Hamiltonian Cycle Problem Using Asynchronous P Systems | 11 | 0.70 | 2012 |
Logic And Arithmetic Operations With A Constant Number Of Steps In Membrane Computing | 8 | 0.65 | 2011 |
Asynchronous P Systems for Arithmetic Operations and Factorization | 3 | 0.46 | 2011 |
Asynchronous P systems for SAT and Hamiltonian cycle problem | 0 | 0.34 | 2010 |
Distributed Algorithms for 2-Connected Sensor Cover in Sensor Network | 1 | 0.41 | 2010 |
Computation with a constant number of steps in membrane computing. | 0 | 0.34 | 2009 |
Special issue on Advances in Parallel and Distributed Computational Models | 0 | 0.34 | 2009 |
Procedures for Floating Point Operations with DNA Molecules | 0 | 0.34 | 2009 |
Dictionary Operations in Membrane Computing | 0 | 0.34 | 2009 |
An Access Point Selection Algorithm for Heterogeneous Stations | 0 | 0.34 | 2008 |
10th workshop on Advances in Parallel and Distributed Computational Models - APDCM'08 | 0 | 0.34 | 2008 |
Special Section on Parallel/Distributed Processing and Systems | 0 | 0.34 | 2007 |
Access point selection algorithms for maximizing throughputs in wireless LAN environment | 8 | 0.70 | 2007 |
Procedures For Computing The Maximum With Dna | 0 | 0.34 | 2007 |
Data structures for storing binary numbers in DNA computing | 0 | 0.34 | 2007 |
Procedures for multiplication and division in DNA computing | 1 | 0.42 | 2006 |
A Cost Optimal Parallel Algorithm For Patience Sorting | 4 | 0.42 | 2006 |
A Procedure for Max-SAT with DNA Strands | 0 | 0.34 | 2006 |
Procedures For Multiple Input Functions With Dna Molecules | 0 | 0.34 | 2005 |
A Scheduling Algorithm With Static Partition For Total Exchange | 0 | 0.34 | 2005 |
Sorting algorithms based on the odd-even transposition sort and the shearsort with DNA strands | 0 | 0.34 | 2005 |
A Procedure for Computing 0-1 Integer Programming with DNA Strands | 0 | 0.34 | 2005 |
Procedures For Logic And Arithmetic Operations With Dna Molecules | 11 | 1.93 | 2004 |
Procedures for Multiple Input Functions with DNA Strands | 0 | 0.34 | 2004 |
Addressable Procedures for Logic and Arithmetic Operations with DNA Strands | 5 | 0.52 | 2003 |
Multipath interference canceller for high-speed packet transmission with adaptive modulation and coding scheme in W-CDMA forward link | 29 | 3.34 | 2002 |
Parallel algorithms for selection on the BSP and BSP* models | 1 | 0.36 | 2002 |
Parallelizability of Some P-Complete Geometric Problems in the EREW-PRAM | 0 | 0.34 | 2001 |
Parallelizability of Some P-Complete Problems | 2 | 0.38 | 2000 |