According to our database1, Mimmo Parente authored at least 67 papers between 1991 and 2019.
Legend:Book In proceedings Article PhD thesis Other
Time-aware adaptive tweets ranking through deep learning.
Future Generation Comp. Syst., 2019
A Granular Functional Network with delay: Some dynamical properties and application to the sign prediction in social networks.
Social media marketing through time-aware collaborative filtering.
Concurrency and Computation: Practice and Experience, 2018
Context-aware Advertisment Recommendation on Twitter through Rough sets.
Proceedings of the 2018 IEEE International Conference on Fuzzy Systems, 2018
An ontology-driven context-aware recommender system for indoor shopping based on cellular automata.
J. Ambient Intelligence and Humanized Computing, 2017
An AmI-based and privacy-preserving shopping mall model.
Modeling cyber-physical systems for automatic verification.
Proceedings of the 14th International Conference on Synthesis, 2017
Solving the shopping plan problem through bio-inspired approaches.
Soft Comput., 2016
Time Aware Knowledge Extraction for microblog summarization on Twitter.
Information Fusion, 2016
A private Intelligent Shopping Mall.
Proceedings of the 2016 IEEE Symposium Series on Computational Intelligence, 2016
OLAP analysis of multidimensional tweet streams for supporting advanced analytics.
Proceedings of the 31st Annual ACM Symposium on Applied Computing, 2016
Time aware knowledge extraction to analyze nanosafety cluster scientific activities.
Proceedings of the IEEE Congress on Evolutionary Computation, 2016
An Agent-Based Framework for Indoor Navigation in Blended Shopping.
Proceedings of the IEEE Symposium Series on Computational Intelligence, 2015
Biomedical data integration and ontology-driven multi-facets visualization.
Proceedings of the 2015 International Joint Conference on Neural Networks, 2015
Online query-focused twitter summarizer through fuzzy lattice.
Proceedings of the 2015 IEEE International Conference on Fuzzy Systems, 2015
Natural Language Query Processing Framework for Biomedical Literature.
Proceedings of the 2015 Conference of the International Fuzzy Systems Association and the European Society for Fuzzy Logic and Technology (IFSA-EUSFLAT-15), 2015
Towards OLAP Analysis of Multidimensional Tweet Streams.
Proceedings of the ACM Eighteenth International Workshop on Data Warehousing and OLAP, 2015
Enhancing an AmI-Based Framework for U-commerce by Applying Memetic Algorithms to Plan Shopping.
Proceedings of the 2014 International Conference on Intelligent Networking and Collaborative Systems, 2014
Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem.
Proceedings of the Computing with New Resources, 2014
Model checking coalitional games in shortage resource scenarios.
Proceedings of the Proceedings Fourth International Symposium on Games, 2013
Int. J. Found. Comput. Sci., 2012
On a Logic for Coalitional Games with Priced-Resource Agents.
Electr. Notes Theor. Comput. Sci., 2011
Graded CTL model checking for test generation.
Proceedings of the 2011 Spring Simulation Multi-conference, 2011
Coalitional Games with Priced-Resource Agents.
Proceedings of the 26th Italian Conference on Computational Logic, Pescara, Italy, August 31, 2011
Graded Alternating-Time Temporal Logic.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010
A NuSMV Extension for Graded-CTL Model Checking.
Proceedings of the Computer Aided Verification, 22nd International Conference, 2010
Model Checking for Graded CTL.
Fundam. Inform., 2009
Graded-CTL: Satisfiability and Symbolic Model Checking.
Proceedings of the Formal Methods and Software Engineering, 2009
Mixed Nash equilibria in selfish routing problems with dynamic constraints.
Theor. Comput. Sci., 2008
Enriched µ-Calculi Module Checking.
Logical Methods in Computer Science, 2008
Verification of scope-dependent hierarchical state machines.
Inf. Comput., 2008
Program Complexity in Hierarchical Module Checking.
Proceedings of the Logic for Programming, 2008
CTLModel-Checking with Graded Quantifiers.
Proceedings of the Automated Technology for Verification and Analysis, 2008
The Firing Squad Synchronization Problem on Squares, Toruses and Rings.
Int. J. Found. Comput. Sci., 2007
The word problem for visibly pushdown languages described by grammars.
Formal Methods in System Design, 2007
Enriched µ-Calculus Pushdown Module Checking.
Proceedings of the Logic for Programming, 2007
Verification of Succinct Hierarchical State Machines.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007
Different time solutions for the firing squad synchronization problem on basic grid networks.
On the Membership Problem for Visibly Pushdown Languages.
Proceedings of the Automated Technology for Verification and Analysis, 2006
On The Vertex-Connectivity Problem For Graphs With Sharpened Triangle Inequality.
Int. J. Found. Comput. Sci., 2004
Model-checking the Secure Release of a Time-locked Secret over a Network.
Electr. Notes Theor. Comput. Sci., 2004
Specification and Verification of Protocols With Time Constraints.
Electr. Notes Theor. Comput. Sci., 2004
Existence of Nash Equilibria in Selfish Routing Problems.
Proceedings of the Structural Information and Communication Complexity, 2004
Optimal Time and Communication Solutions of Firing Squad Synchronization Problems on Square Arrays, Toruses and Rings.
Proceedings of the Developments in Language Theory, 2004
An Approximation Algorithm for the Minimum Weight Vertex-Connectivity Problem in Complete Graphs with Sharpened Triangle Inequality.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003
Hierarchical and Recursive State Machines with Context-Dependent Properties.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints.
Proceedings of the Machines, 2001
A compositional approach to synchronize two dimensional networks of processors.
A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph.
J. Algorithms, 1999
Placing Resources on a Growing Line.
J. Algorithms, 1998
Succinctness of Descriptions of SBTA-Languages.
Theor. Comput. Sci., 1997
Synchronization of a Line of Identical Processors at a Given Time.
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997
Better Algorithms for Minimum Weight Vertex-Connectivity Problems.
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997
Synchronization of 1-Way Connected Processors.
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997
Dynamic and Static Algorithms for Optimal Placement of Resources in a Tree.
Theor. Comput. Sci., 1996
Parallel Word Substitution.
Fundam. Inform., 1996
Synchronization of One-way Connected Processors.
Complex Systems, 1996
A Linear Time Algorithm for the Feasibility of Pebble Motion on Trees.
Proceedings of the Algorithm Theory, 1996
A New Approach to Optimal Planning of Robot Motion on a Tree with Obstacles.
Proceedings of the Algorithms, 1996
Power of Interconnections and of Nondeterminism in Regular Y-Tree Systolic Automata.
Mathematical Systems Theory, 1995
State Complexity of SBTA Languages.
Proceedings of the LATIN '95: Theoretical Informatics, 1995
Placing Resources in a Tree: Dynamic and Static Algorithms.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995
Optimization of Systolic Tree Automata.
Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994
On the Minimization and Succintness of Systolic Binary Tree Automata.
Sci. Ann. Cuza Univ., 1993
Languages Accepted by Systolic Y-Tree Automata: Structural Characterizations.
Acta Inf., 1992
Systolic Tree with Base Automata.
Int. J. Found. Comput. Sci., 1991
Systolic Y-Tree Automata: Closure Properties and Decision Problems.
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991