Search results for "Theoretical Computer Science"
showing 10 items of 1151 documents
HEURISTIC PROCEDURES FOR GROUP SCHEDULING
1989
ABSTRACT The group scheduling problem is investigated, solving numerous small and large sized examples with eight sequencing algorithms. A new approach, basically consisting in the definition of real machines' idles for each group, utilizing allowed shifting of non critical activities, is proposed. Moreover the CDS multi-shot algorithm is extended to group scheduling.
Stackelberg Game Theory Based Energy Management Systems in the Presence of Renewable Energy Sources
2021
The game theory concept has been adapted for energy management between energy producers and consumers in the presence of renewable energy sources (RES) and electric vehicles (EVs). The objective of...
Mathematical Control of Complex Systems 2013
2014
Mathematical control of complex systems have already become an ideal research area for control engineers, mathematicians, computer scientists, and biologists to understand, manage, analyze, and interpret functional information/dynamical behaviours from real-world complex dynamical systems, such as communication systems, process control, environmental systems, intelligent manufacturing systems, transportation systems, and structural systems. This special issue aims to bring together the latest/innovative knowledge and advances in mathematics for handling complex systems. Topics include, but are not limited to the following: control systems theory (behavioural systems, networked control syste…
Optimizing H.264/AVC interprediction on a GPU-based framework
2011
H.264/MPEG-4 part 10 is the latest standard for video compression and promises a significant advance in terms of quality and distortion compared with the commercial standards currently most in use such as MPEG-2 or MPEG-4. To achieve this better performance, H.264 adopts a large number of new/improved compression techniques compared with previous standards, albeit at the expense of higher computational complexity. In addition, in recent years new hardware accelerators have emerged, such as graphics processing units (GPUs), which provide a new opportunity to reduce complexity for a large variety of algorithms. However, current GPUs suffer from higher power consumption requirements because of…
On the intrinsic complexity of learning
1995
A new view of learning is presented. The basis of this view is a natural notion of reduction. We prove completeness and relative difficulty results. An infinite hierarchy of intrinsically more and more difficult to learn concepts is presented. Our results indicate that the complexity notion captured by our new notion of reduction differs dramatically from the traditional studies of the complexity of the algorithms performing learning tasks.
Compartmental analysis of dynamic nuclear medicine data: Models and identifiability
2016
Compartmental models based on tracer mass balance are extensively used in clinical and pre-clinical nuclear medicine in order to obtain quantitative information on tracer metabolism in the biological tissue. This paper is the first of a series of two that deal with the problem of tracer coefficient estimation via compartmental modelling in an inverse problem framework. Specifically, here we discuss the identifiability problem for a general n-dimension compartmental system and provide uniqueness results in the case of two-compartment and three-compartment compartmental models. The second paper will utilize this framework in order to show how non-linear regularization schemes can be applied t…
Composition of a New Process to Meet Agile Needs Using Method Engineering
2005
The need of developing a new software engineering process to allow the quick prototyping of some robotic applications and meet the requests by some companies for a development process that was shorter than PASSI, gave us the opportunity of applying our studies on the assembling of a new SEP by reusing parts (called method fragments) from other processes. In this paper we discuss our approach that, starting from the method engineering paradigm, adapts and extends it considering specific agent-oriented issues like the multi-agent system meta-model. The final result of our experiment (Agile PASSI) is presented together with the requirements that motivated its structure. © Springer-Verlag Berli…
Online Black-Markets: An Investigation of a Digital Infrastructure in the Dark
2021
AbstractThis paper investigates the functioning of Online Black-Markets (OBMs), i.e. a digital infrastructure operating in the Dark Net that enables the exchange of illegal goods such as drugs, weapons and fake digital identities. OBMs exist notwithstanding adverse conditions such as police interventions, scams and market breakdowns. Relying on a longitudinal case study, we focus on the dynamics of interactions among actors and marketplace technologies and we identify three mechanisms explaining OBMs operations. In particular, we show that OBMs infrastructure is the result of commoditization, platformization and resilience processes. Our contribution relies on the identification of communit…
Fuzzy Metric Approach to Aggregation of Risk Levels
2019
In this paper we propose a special construction of a general aggregation operator. The construction allows to aggregate fuzzy sets taking into account the distance between elements of the universe. We consider the case when fuzzy sets to be aggregated represent the risk level evaluation by several experts. We describe how the proposed construction could be applied for risk level assessment in the case when a strong fuzzy metric is used to characterize the similarity of objects under evaluation.
Expressive and efficient pattern languages for tree-structured data (extended abstract)
2000
It would be desirable to have a query language for tree-structured data that is (1) as easily usable as SQL, (2) as expressive as monadic second-order logic (MSO), and (3) efficiently evaluable. The paper develops some ideas in this direction. Towards (1) the specification of sets of vertices of a tree by combining conditions on their induced subtree with conditions on their path to the root is proposed. Existing query languages allow regular expressions (hence MSO logic) in path conditions but are limited in expressing subtree conditions. It is shown that such query languages fall short of capturing all MSO queries. On the other hand, allowing a certain guarded fragment of MSO-logic in the…