• Conference Object  

      Argumentative alternating offers 

      Hadidi, N.; Dimopoulos, Yannis; Moraïtis, Pavlos (International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2010)
      This paper presents an argumentative version of the well known alternating offers negotiation protocol. The negotiation mechanism is based on an abstract preference based argumentation framework where both epistcmic and ...
    • Article  

      Argumentative alternating offers 

      Hadidi, N.; Dimopoulos, Yannis; Moraïtis, Pavlos (2011)
      This paper presents an argumentative version of the well known alternating offers negotiation protocol. The negotiation mechanism is based on an abstract preference based argumentation framework where both epistemic and ...
    • Conference Object  

      Aspect oriented programming for a component-based real life application: A case study 

      Papapetrou, Odysseas; Papadopoulos, George Angelos (2004)
      Aspect Oriented Programming, a relatively new programming paradigm, earned the scientific community's attention. The paradigm is already evaluated for traditional OOP and component-based software development with remarkable ...
    • Article  

      Asynchronous timed multimedia environments based on the coordination paradigm 

      Papadopoulos, George Angelos (2003)
      This paper combines work done in the areas of Artificial Intelligence, Multimedia Systems and Coordination Programming to derive a framework for Distributed Multimedia Systems based on asynchronous timed computations ...
    • Conference Object  

      Deriving quantitative structure-activity relationship models using genetic programming for drug discovery 

      Neophytou, K.; Nicolaou, Christos A.; Pattichis, Constantinos S.; Schizas, Christos N. (2008)
      Genetic Programming is a heuristic search algorithm inspired by evolutionary techniques that has been shown to produce satisfactory solutions to problems related to several scientific domains [1]. Presented here is a ...
    • Conference Object  

      Distributed stopping for average consensus using double linear iterative strategies 

      Manitara, N. E.; Hadjicostis, Christoforos N. (Institute of Electrical and Electronics Engineers Inc., 2014)
      We consider how double linear iterative strategies for asymptotic average consensus can be adapted so that the nodes can determine, in a distributed fashion, a stopping criterion that allows them to terminate (in finite ...
    • Article  

      Exploiting locality for scalable information retrieval in peer-to-peer networks 

      Zeinalipour-Yazdi, Constantinos D.; Kalogeraki, Vana; Gunopulos, Dimitrios (2005)
      An important problem in unstructured peer-to-peer (P2P) networks is the efficient content-based retrieval of documents shared by other peers. However, existing searching mechanisms are not scaling well because they are ...
    • Conference Object  

      Extracting parallelism in Fortran by translation to a single assignment intermediate form 

      Barry, Robert J.; Evripidou, Paraskevas (Publ by IEEE, 1994)
      This paper presents MUSTANG, a system for translating Fortran to single assignment form in an effort to automatically extract parallelism. Specifically, a sequential Fortran source program is translated into IF1, a ...
    • Article  

      Fault-tolerant convolution via chinese remainder codes constructed from non-coprime moduli 

      Sundaram, S.; Hadjicostis, Christoforos N. (2008)
      This paper develops a framework for performing fault-tolerant convolution via error-correcting codes based on the chinese remainder theorem (CRT) with non-coprime moduli. In contrast to convolution that is protected through ...
    • Article  

      Feel the world: A mobile framework for participatory sensing 

      Phokas, T.; Efstathiades, Hariton; Pallis, George C.; Dikaiakos, Marios D. (2013)
      Nowadays, smartphones have almost replaced basic feature phones all over the world. Today's smartphones come equipped with an increasing set of embedded sensors, computational and communication resources. All these gave ...
    • Conference Object  

      GridBench: A tool for benchmarking grids 

      Tsouloupas, George; Dikaiakos, Marios D. (IEEE Computer Society, 2003)
      The aim of the GridBench suite of benchmarks is to bring together a core set of benchmarks for characterizing grid nodes or collections of grid resources. In order to do this in an organized and flexible way we provide a ...
    • Article  

      Instruction-Isomorphism in program execution 

      Sazeides, Yiannakis (2003)
      This paper identifies a fundamental runtime program property: Instruction-Isomorphism. An instruction instance is said to be isomorphic if its component - Information derived from the instruction and its backward dynamic ...
    • Conference Object  

      Nature inspired node density estimation for molecular NanoNetworks 

      Saeed, T.; Lestas, Marios; Pitsillides, Andreas (Association for Computing Machinery, Inc, 2016)
      Inspired by the quorum sensing process, we propose and analyze a distributed density estimation scheme for molecular nanonetworks, based on synchronous transmission of the network nodes and sensing of the received molecular ...
    • Conference Object  

      Programming abstractions and toolchain for dataflow multithreading architectures 

      Stavrou, Kyriakos; Pavlou, Demos; Nikolaides, Marios; Petrides, P.; Evripidou, Paraskevas; Trancoso, Pedro; Popovic, Z.; Giorgi, Roberto (2009)
      The need to exploit multi-core systems for parallel processing has revived the concept of dataflow. In particular, the Dataflow Multithreading architectures have proven to be good candidates for these systems. In this work ...
    • Conference Object  

      Reasoning about actions and change in answer set programming 

      Dimopoulos, Yannis; Kakas, Antonis C.; Michael, Loizos (Springer Verlag, 2004)
      This paper studies computational issues related to the problem of reasoning about actions and change (RAC) by exploiting its link with the Answer Set Programming paradigm. It investigates how increasing the expressiveness ...
    • Article  

      Robust multiobjective portfolio optimization: A minimax regret approach 

      Xidonas, Panos; Mavrotas, George; Hassapis, Christis; Zopounidis, Constantin (2017)
      An efficient frontier in the typical portfolio selection problem provides an illustrative way to express the tradeoffs between return and risk. Following the basic ideas of modern portfolio theory as introduced by Markowitz, ...
    • Conference Object  

      Selecting Long Atomic Traces for High Coverage 

      Rosner, R.; Moffie, M.; Sazeides, Yiannakis; Ronen, R. (2003)
      This paper performs a comprehensive investigation of dynamic selection for long atomic traces. It introduces a classification of trace selection methods and discusses existing and novel dynamic selection approaches - ...
    • Article  

      Temporal planning through mixed integer programming: A preliminary report 

      Dimopoulos, Yannis; Gerevini, A. (2002)
      Temporal planning is an important problem, as in many real world planning domains actions have different durations and the goals should be achieved by a specified deadline, or as soon as possible. This paper presents a ...
    • Conference Object  

      Toward energy-aware balancing of mobile graphics 

      Stavrakis, E.; Polychronis, M.; Pelekanos, Nectarios; Artusi, A.; Hadjichristodoulou, P.; Chrysanthou, Yiorgos L. (SPIE, 2015)
      In the area of computer graphics the design of hardware and software has primarily been driven by the need to achieve maximum performance. Energy efficiency was usually neglected, assuming that a stable always-on power ...
    • Article  

      Towards local search for answer sets 

      Dimopoulos, Yannis; Sideris, A. (2002)
      Answer set programming has emerged as a new important paradigm for declarative problem solving. It relies on algorithms that compute the stable models of a logic program, a problem that is, in the worst-case, intractable. ...