andreasenese Goto Github PK

algorithms-and-complexity

Motivations Real optimization problems From real problems to paradigmatic computational problems Complessità di problemi computazionali (paradigmatici) Refreshing: (N)PTIME, problem reduction, NP-completeness, etc. Cook-Levin Theorem: proof SAT-solver and applications Relevant chains of reductions: SAT --> Optimization problems Classical techniques for NP-complete problems Backtracking Branch&Bound Linear relaxation Approximation (absolute, relative) Dynamic programming Non classical techniques for NP-complete problems Examples of reference Randomized algorithms Models Classification (for the optimization) Design paradigms Probabilistic computational complexity classes

algorithms-and-data-structure

imperative algorithm optimization

andreasenese

Config files for my GitHub profile.

andreasenese.github.io

infer_algorithm

A parallel inference skeleton algorithm in Haskell

intelligent-agent-multiagent-systems

- Introduction to intelligent agents. - Agents as intensional systems. Abstract architectures for intelligent agents. - Deductive reasoning agents. - Logics for multiagent systems: modal logic, temporal logic, logics for knowledge e belief. Model checking. - Formal models for BDI (Belief, Desire, Intention) agents: Cohen and Levesque's intetion logic. - Practical Reasoning Agents. Agent Oriented Programming. Concurrent METATEM. GOLOG. - Reactive and hybrid agents. - Multiagent systems. - Multiagent Systems and Societies of Agents. - Communication: Agent Communication Languages (ACL), SInteraction Protocols, Social Semantics and Commitment Protocols. - Multiagent interactions: game theory, strategies and Nash equilibria. - Allocating Scarce Resources: Auctions. - Languages and environments for multiagent systems: Jade, Jason, JaCaMo.

mobile-device-programming

Introduction to the design of mobile applications;. Mobile application development: Android platform; iOS platform (hints); cross-platform (hints). Introduction to the aggregate programming pararadigm.

verification-of-concurrent-and-distributed-programs

An introduction to system verification => a first specification language: Petri nets and colored Petri nets; definition, properties and avaiable tools (GreatSPN) - a second specification language: process algebras; - properties' specification languages: linear temporal logic, branching temporal logics and available model-checking tools and associated tools (nuSMV and RGMEDD) - expressing timed models and timed properties: timed automata and timed branching logics and associated tool (Uppaal)