Browsing Computer Science by Title
Now showing items 63-82 of 549
-
Bidding support by the pocket negotiator improves negotiation outcomes
(Springer, 2023)This paper presents the negotiation support mechanisms provided by the Pocket Negotiator (PN) and an elaborate empirical evaluation of the economic decision support (EDS) mechanisms during the bidding phase of negotiations ... -
A big data processing framework for self-healing internet of things applications
(IEEE, 2016)In this study, we introduce a big data processing framework that provides self-healing capability in the Internet of Things domain. We discuss the high-level architecture of this framework and its prototype implementation. ... -
BioCode: A data-driven procedure to learn the growth of biological networks
(IEEE, 2022-11)Probabilistic biological network growth models have been utilized for many tasks including but not limited to capturing mechanism and dynamics of biological growth activities, null model representation, capturing anomalies, ... -
Black-box test case selection by relating code changes with previously fixed defects
(ACM, 2022-06)Software continuously changes to address new requirements and to fix defects. Regression testing is performed to ensure that the applied changes do not adversely affect existing functionality. The increasing number of test ... -
BoB: Bandwidth prediction for real-time communications using heuristic and reinforcement learning
(IEEE, 2023)Bandwidth prediction is critical in any Real-time Communication (RTC) service or application. This component decides how much media data can be sent in real time. Subsequently, the video and audio encoder dynamically adapts ... -
Bottom-up approaches to achieve Pareto optimal agreements in group decision making
(Springer Nature, 2019-11)In this article, we introduce a new paradigm to achieve Pareto optimality in group decision-making processes: bottom-up approaches to Pareto optimality. It is based on the idea that, while resolving a conflict in a group, ... -
Building the Turkish FrameNet
(Global WordNet Association, 2021)FrameNet (Lowe, 1997; Baker et al., 1998; Fillmore and Atkins, 1998; Johnson et al., 2001) is a computational lexicography project that aims to offer insight into the semantic relationships between predicate and arguments. ... -
Büyük veri problemlerine çözüm olarak veri akış madenciliği
(IEEE, 2013)Günümüzde bilişim dünyası faydalı bilgiye ulaşma yolunda “büyük veri” problemleri (verinin kütlesi, hızı, çeşitliliği, tutarsızlığı) ile baş etmeye çalışmaktadır. Bu makalede, büyük veri akışları üzerinde İlişkisel Kural ... -
Campaign participation prediction with deep learning
(Elsevier, 2021-08)Increasingly, on-demand nature of customer interactions put pressure on companies to build real-time campaign management systems. Instead of having managers to decide on the campaign rules, such as, when, how and whom to ... -
Can social agents efficiently perform in automated negotiation?
(MDPI, 2021-07)In the last few years, we witnessed a growing body of literature about automated negotiation. Mainly, negotiating agents are either purely self-driven by maximizing their utility function or by assuming a cooperative stance ... -
Catching the moment with LoL + in twitch-like low-latency live streaming platforms
(IEEE, 2022)Our earlier Low-on-Latency (dubbed as LoL) solution offered an accurate bandwidth prediction and rate adaptation algorithm tailored for live streaming applications that targeted an end-to-end latency of up to two seconds. ... -
CEUR workshop proceedings: preface
(2016) -
The challenge of negotiation in the game of diplomacy
(Springer Nature, 2019)The game of Diplomacy has been used as a test case for complex automated negotiations for a long time, but to date very few successful negotiation algorithms have been implemented for this game. We have therefore decided ... -
Challenges and main results of the automated negotiating agents competition (ANAC) 2019
(Springer, 2020)The Automated Negotiating Agents Competition (ANAC) is a yearly-organized international contest in which participants from all over the world develop intelligent negotiating agents for a variety of negotiation problems. ... -
CheckMate: English grammatical error correction for native Turkish speakers
(IEEE, 2023)The covid-19 outbreak left many countries have no choice but turn to online education. Turkish students, who were among those who were affected, faced difficulties in improving their English as the opportunity to have ... -
Coevolution index: A metric for tracking evolutionary coupling
(IEEE, 2023)This paper proposes a new metric, namely the coevolution index (CEI), for measuring the relative evolutionary coupling of modules of a software system. CEI is inspired by the h-index, which is a popular metric used for ... -
Cognition-enabled robot manipulation in human environments: requirements, recent work, and open problems
(IEEE, 2017-09)Service robots are expected to play an important role in our daily lives as our companions in home and work environments in the near future. An important requirement for fulfilling this expectation is to equip robots with ... -
Collective voice of experts in multilateral negotiation
(Springer International Publishing, 2017)Inspired from the ideas such as “algorithm portfolio”, “mixture of experts”, and “genetic algorithm”, this paper presents two novel negotiation strategies, which combine multiple negotiation experts to decide what to bid ... -
Combined AES + AEGIS architectures for high performance and lightweight security applications
(Springer International Publishing, 2014)AES has been the prominent block cipher since its introduction as the standard. It has been the cipher used in almost all new applications that require solid, unbreakable security with reasonable resource usage. Several ... -
Combined weight and density bounds on the polynomial threshold function representation of Boolean functions
(Elsevier, 2022-08)In an earlier report it was shown that an arbitrary n-variable Boolean function f can be represented as a polynomial threshold function (PTF) with 0.75×2n or less number of monomials. In this report, we derive an upper ...
Share this page
