Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
37,407 | Stochastic Global Optimization Algorithms: A Systematic Formal Approach | cs.AI | As we know, some global optimization problems cannot be solved using analytic
methods, so numeric/algorithmic approaches are used to find near to the optimal
solutions for them. A stochastic global optimization algorithm (SGoal) is an
iterative algorithm that generates a new population (a set of candidate
solutions) fr... | computer science |
37,408 | Can Computers overcome Humans? Consciousness interaction and its
implications | cs.AI | Can computers overcome human capabilities? This is a paradoxical and
controversial question, particularly because there are many hidden assumptions.
This article focuses on that issue putting on evidence some misconception
related with future generations of machines and the understanding of the brain.
It will be discus... | computer science |
37,409 | Dynamic Discovery of Type Classes and Relations in Semantic Web Data | cs.DB | The continuing development of Semantic Web technologies and the increasing
user adoption in the recent years have accelerated the progress incorporating
explicit semantics with data on the Web. With the rapidly growing RDF (Resource
Description Framework) data on the Semantic Web, processing large semantic
graph data h... | computer science |
37,411 | Dynamic Difficulty Adjustment on MOBA Games | cs.AI | This paper addresses the dynamic difficulty adjustment on MOBA games as a way
to improve the player's entertainment. Although MOBA is currently one of the
most played genres around the world, it is known as a game that offer less
autonomy, more challenges and consequently more frustration. Due to these
characteristics,... | computer science |
37,412 | A Tutor Agent for MOBA Games | cs.AI | Digital games have become a key player in the entertainment industry,
attracting millions of new players each year. In spite of that, novice players
may have a hard time when playing certain types of games, such as MOBAs and
MMORPGs, due to their steep learning curves and not so friendly online
communities. In this pap... | computer science |
37,413 | Ethical Artificial Intelligence - An Open Question | cs.AI | Artificial Intelligence (AI) is an effective science which employs strong
enough approaches, methods, and techniques to solve unsolvable real world based
problems. Because of its unstoppable rise towards the future, there are also
some discussions about its ethics and safety. Shaping an AI friendly
environment for peop... | computer science |
37,414 | Towards balanced clustering - part 1 (preliminaries) | cs.DS | The article contains a preliminary glance at balanced clustering problems.
Basic balanced structures and combinatorial balanced problems are briefly
described. A special attention is targeted to various balance/unbalance indices
(including some new versions of the indices): by cluster cardinality, by
cluster weights, b... | computer science |
37,415 | Towards Statistical Reasoning in Description Logics over Finite Domains
(Full Version) | cs.AI | We present a probabilistic extension of the description logic $\mathcal{ALC}$
for reasoning about statistical knowledge. We consider conditional statements
over proportions of the domain and are interested in the probabilistic-logical
consequences of these proportions. After introducing some general reasoning
problems ... | computer science |
37,416 | On Hash-Based Work Distribution Methods for Parallel Best-First Search | cs.AI | Parallel best-first search algorithms such as Hash Distributed A* (HDA*)
distribute work among the processes using a global hash function. We analyze
the search and communication overheads of state-of-the-art hash-based parallel
best-first search algorithms, and show that although Zobrist hashing, the
standard hash fun... | computer science |
37,417 | Learning Large-Scale Topological Maps Using Sum-Product Networks | cs.RO | In order to perform complex actions in human environments, an autonomous
robot needs the ability to understand the environment, that is, to gather and
maintain spatial knowledge. Topological map is commonly used for representing
large scale, global maps such as floor plans. Although much work has been done
in topologic... | computer science |
37,418 | DAC-h3: A Proactive Robot Cognitive Architecture to Acquire and Express
Knowledge About the World and the Self | cs.AI | This paper introduces a cognitive architecture for a humanoid robot to engage
in a proactive, mixed-initiative exploration and manipulation of its
environment, where the initiative can originate from both the human and the
robot. The framework, based on a biologically-grounded theory of the brain and
mind, integrates a... | computer science |
37,419 | Recommendations for Marketing Campaigns in Telecommunication Business
based on the footprint analysis | cs.AI | A major investment made by a telecom operator goes into the infrastructure
and its maintenance, while business revenues are proportional to how big and
good the customer base is. We present a data-driven analytic strategy based on
combinatorial optimization and analysis of historical data. The data cover
historical mob... | computer science |
37,420 | Technical Report: Implementation and Validation of a Smart Health
Application | cs.AI | In this article, we explain in detail the internal structures and databases
of a smart health application. Moreover, we describe how to generate a
statistically sound synthetic dataset using real-world medical data. | computer science |
37,421 | Autonomous Reactive Mission Scheduling and Task-Path Planning
Architecture for Autonomous Underwater Vehicle | cs.RO | An Autonomous Underwater Vehicle (AUV) should carry out complex tasks in a
limited time interval. Since existing AUVs have limited battery capacity and
restricted endurance, they should autonomously manage mission time and the
resources to perform effective persistent deployment in longer missions. Task
assignment requ... | computer science |
37,422 | Simultaneous merging multiple grid maps using the robust motion
averaging | cs.AI | Mapping in the GPS-denied environment is an important and challenging task in
the field of robotics. In the large environment, mapping can be significantly
accelerated by multiple robots exploring different parts of the environment.
Accordingly, a key problem is how to integrate these local maps built by
different robo... | computer science |
37,423 | Learning and Evaluating Musical Features with Deep Autoencoders | cs.SD | In this work we describe and evaluate methods to learn musical embeddings.
Each embedding is a vector that represents four contiguous beats of music and
is derived from a symbolic representation. We consider autoencoding-based
methods including denoising autoencoders, and context reconstruction, and
evaluate the result... | computer science |
37,424 | Learning a visuomotor controller for real world robotic grasping using
simulated depth images | cs.RO | We want to build robots that are useful in unstructured real world
applications, such as doing work in the household. Grasping in particular is an
important skill in this domain, yet it remains a challenge. One of the key
hurdles is handling unexpected changes or motion in the objects being grasped
and kinematic noise ... | computer science |
37,425 | Conjunctions of Among Constraints | cs.AI | Many existing global constraints can be encoded as a conjunction of among
constraints. An among constraint holds if the number of the variables in its
scope whose value belongs to a prespecified set, which we call its range, is
within some given bounds. It is known that domain filtering algorithms can
benefit from reas... | computer science |
37,426 | From Propositional Logic to Plausible Reasoning: A Uniqueness Theorem | cs.AI | We consider the question of extending propositional logic to a logic of
plausible reasoning, and posit four requirements that any such extension should
satisfy. Each is a requirement that some property of classical propositional
logic be preserved in the extended logic; as such, the requirements are simpler
and less pr... | computer science |
37,427 | The impact of Entropy and Solution Density on selected SAT heuristics | cs.AI | In a recent article [Oh'15], Oh examined the impact of various key heuristics
(e.g., deletion strategy, restart policy, decay factor, database reduction) in
competitive SAT solvers. His key findings are that their expected success
depends on whether the input formula is satisfiable or not. To further
investigate these ... | computer science |
37,428 | The Complexity of Campaigning | cs.AI | In "The Logic of Campaigning", Dean and Parikh consider a candidate making
campaign statements to appeal to the voters. They model these statements as
Boolean formulas over variables that represent stances on the issues, and study
optimal candidate strategies under three proposed models of voter preferences
based on th... | computer science |
37,429 | Word-Entity Duet Representations for Document Ranking | cs.IR | This paper presents a word-entity duet framework for utilizing knowledge
bases in ad-hoc retrieval. In this work, the query and documents are modeled by
word-based representations and entity-based representations. Ranking features
are generated by the interactions between the two representations,
incorporating informat... | computer science |
37,430 | Toward Real-Time Decentralized Reinforcement Learning using Finite
Support Basis Functions | cs.RO | This paper addresses the design and implementation of complex Reinforcement
Learning (RL) behaviors where multi-dimensional action spaces are involved, as
well as the need to execute the behaviors in real-time using robotic platforms
with limited computational resources and training times. For this purpose, we
propose ... | computer science |
37,431 | Combined Task and Motion Planning as Classical AI Planning | cs.RO | Planning in robotics is often split into task and motion planning. The
high-level, symbolic task planner decides what needs to be done, while the
motion planner checks feasibility and fills up geometric detail. It is known
however that such a decomposition is not effective in general as the symbolic
and geometrical com... | computer science |
37,432 | Web-STAR: Towards a Visual Web-Based IDE for a Story Comprehension
System | cs.HC | In this work, we present Web-STAR, an online platform for story understanding
built on top of the STAR (STory comprehension through ARgumentation) reasoning
engine. This platform includes a web-based IDE, integration with the STAR
system and a web service infrastructure to support integration with other
systems that re... | computer science |
37,433 | A Framework for Accurate Drought Forecasting System Using
Semantics-Based Data Integration Middleware | cs.DB | Technological advancement in Wireless Sensor Networks (WSN) has made it
become an invaluable component of a reliable environmental monitoring system;
they form the digital skin' through which to 'sense' and collect the context of
the surroundings and provides information on the process leading to complex
events such as... | computer science |
37,434 | Inter-Session Modeling for Session-Based Recommendation | cs.IR | In recent years, research has been done on applying Recurrent Neural Networks
(RNNs) as recommender systems. Results have been promising, especially in the
session-based setting where RNNs have been shown to outperform state-of-the-art
models. In many of these experiments, the RNN could potentially improve the
recommen... | computer science |
37,435 | Finding optimal finite biological sequences over finite alphabets: the
OptiFin toolbox | cs.AI | In this paper, we present a toolbox for a specific optimization problem that
frequently arises in bioinformatics or genomics. In this specific optimisation
problem, the state space is a set of words of specified length over a finite
alphabet. To each word is associated a score. The overall objective is to find
the word... | computer science |
37,436 | The Boolean Solution Problem from the Perspective of Predicate Logic -
Extended Version | cs.LO | Finding solution values for unknowns in Boolean equations was a principal
reasoning mode in the Algebra of Logic of the 19th century. Schr\"oder
investigated it as "Aufl\"osungsproblem" ("solution problem"). It is closely
related to the modern notion of Boolean unification. Today it is commonly
presented in an algebrai... | computer science |
37,437 | A Simulator for Hedonic Games | cs.MA | Hedonic games are meant to model how coalitions of people form and break
apart in the real world. However, it is difficult to run simulations when
everything must be done by hand on paper. We present an online software that
allows fast and visual simulation of several types of hedonic games.
http://lukemiles.org/hedoni... | computer science |
37,438 | Developing Bug-Free Machine Learning Systems With Formal Mathematics | cs.SE | Noisy data, non-convex objectives, model misspecification, and numerical
instability can all cause undesired behaviors in machine learning systems. As a
result, detecting actual implementation errors can be extremely difficult. We
demonstrate a methodology in which developers use an interactive proof
assistant to both ... | computer science |
37,439 | Strategyproof Mechanisms for Additively Separable Hedonic Games and
Fractional Hedonic Games | cs.AI | Additively separable hedonic games and fractional hedonic games have received
considerable attention. They are coalition forming games of selfish agents
based on their mutual preferences. Most of the work in the literature
characterizes the existence and structure of stable outcomes (i.e., partitions
in coalitions), as... | computer science |
37,440 | A Pig, an Angel and a Cactus Walk Into a Blender: A Descriptive Approach
to Visual Blending | cs.AI | A descriptive approach for automatic generation of visual blends is
presented. The implemented system, the Blender, is composed of two components:
the Mapper and the Visual Blender. The approach uses structured visual
representations along with sets of visual relations which describe how the
elements (in which the visu... | computer science |
37,441 | Logic Programming for an Introductory Computer Science Course for High
School Students | cs.CY | This paper investigates how high school students approach computing through
an introductory computer science course situated in the Logic Programming (LP)
paradigm. This study shows how novice students operate within the LP paradigm
while engaging in foundational computing concepts and skills, and presents a
case for L... | computer science |
37,442 | Path planning for Robotic Mobile Fulfillment Systems | cs.AI | This paper presents a collection of path planning algorithms for real-time
movement of multiple robots across a Robotic Mobile Fulfillment System (RMFS).
Robots are assigned to move storage units to pickers at working stations
instead of requiring pickers to go to the storage area. Path planning
algorithms aim to find ... | computer science |
37,443 | Path Integral Networks: End-to-End Differentiable Optimal Control | cs.AI | In this paper, we introduce Path Integral Networks (PI-Net), a recurrent
network representation of the Path Integral optimal control algorithm. The
network includes both system dynamics and cost models, used for optimal control
based planning. PI-Net is fully differentiable, learning both dynamics and cost
models end-t... | computer science |
37,444 | Speaker Identification in each of the Neutral and Shouted Talking
Environments based on Gender-Dependent Approach Using SPHMMs | cs.AI | It is well known that speaker identification performs extremely well in the
neutral talking environments; however, the identification performance is
declined sharply in the shouted talking environments. This work aims at
proposing, implementing and testing a new approach to enhance the declined
performance in the shout... | computer science |
37,445 | New Fairness Metrics for Recommendation that Embrace Differences | cs.CY | We study fairness in collaborative-filtering recommender systems, which are
sensitive to discrimination that exists in historical data. Biased data can
lead collaborative filtering methods to make unfair predictions against
minority groups of users. We identify the insufficiency of existing fairness
metrics and propose... | computer science |
37,446 | Tableaux for Policy Synthesis for MDPs with PCTL* Constraints | cs.LO | Markov decision processes (MDPs) are the standard formalism for modelling
sequential decision making in stochastic environments. Policy synthesis
addresses the problem of how to control or limit the decisions an agent makes
so that a given specification is met. In this paper we consider PCTL*, the
probabilistic counter... | computer science |
37,447 | A reliability-based approach for influence maximization using the
evidence theory | cs.SI | The influence maximization is the problem of finding a set of social network
users, called influencers, that can trigger a large cascade of propagation.
Influencers are very beneficial to make a marketing campaign goes viral through
social networks for example. In this paper, we propose an influence measure
that combin... | computer science |
37,448 | Ising Processing Units: Potential and Challenges for Discrete
Optimization | math.OC | The recent emergence of novel computational devices, such as adiabatic
quantum computers, CMOS annealers, and optical parametric oscillators, presents
new opportunities for hybrid-optimization algorithms that leverage these kinds
of specialized hardware. In this work, we propose the idea of an Ising
processing unit as ... | computer science |
37,449 | Submodular Function Maximization for Group Elevator Scheduling | cs.AI | We propose a novel approach for group elevator scheduling by formulating it
as the maximization of submodular function under a matroid constraint. In
particular, we propose to model the total waiting time of passengers using a
quadratic Boolean function. The unary and pairwise terms in the function denote
the waiting t... | computer science |
37,450 | A Reverse Hex Solver | cs.AI | We present Solrex,an automated solver for the game of Reverse Hex.Reverse
Hex, also known as Rex, or Misere Hex, is the variant of the game of Hex in
which the player who joins her two sides loses the game. Solrex performs a
mini-max search of the state space using Scalable Parallel Depth First Proof
Number Search, enh... | computer science |
37,451 | Creative Robot Dance with Variational Encoder | cs.AI | What we appreciate in dance is the ability of people to sponta- neously
improvise new movements and choreographies, sur- rendering to the music rhythm,
being inspired by the cur- rent perceptions and sensations and by previous
experiences, deeply stored in their memory. Like other human abilities, this,
of course, is c... | computer science |
37,452 | Methods for finding leader--follower equilibria with multiple followers | cs.GT | The concept of leader--follower (or Stackelberg) equilibrium plays a central
role in a number of real--world applications of game theory. While the case
with a single follower has been thoroughly investigated, results with multiple
followers are only sporadic and the problem of designing and evaluating
computationally ... | computer science |
37,453 | Evaluating Social Networks Using Task-Focused Network Inference | cs.SI | Networks are representations of complex underlying social processes. However,
the same given network may be more suitable to model one behavior of
individuals than another. In many cases, aggregate population models may be
more effective than modeling on the network. We present a general framework for
evaluating the su... | computer science |
37,454 | Armstrong's Axioms and Navigation Strategies | cs.AI | The paper investigates navigability with imperfect information. It shows that
the properties of navigability with perfect recall are exactly those captured
by Armstrong's axioms from the database theory. If the assumption of perfect
recall is omitted, then Armstrong's transitivity axiom is not valid, but it can
be repl... | computer science |
37,455 | Strategic Coalitions with Perfect Recall | cs.AI | The paper proposes a bimodal logic that describes an interplay between
distributed knowledge modality and coalition know-how modality. Unlike other
similar systems, the one proposed here assumes perfect recall by all agents.
Perfect recall is captured in the system by a single axiom. The main technical
results are the ... | computer science |
37,456 | Comparison of Multiple Features and Modeling Methods for Text-dependent
Speaker Verification | cs.SD | Text-dependent speaker verification is becoming popular in the speaker
recognition society. However, the conventional i-vector framework which has
been successful for speaker identification and other similar tasks works
relatively poorly in this task. Researchers have proposed several new methods
to improve performance... | computer science |
37,457 | Freeway Merging in Congested Traffic based on Multipolicy Decision
Making with Passive Actor Critic | cs.AI | Freeway merging in congested traffic is a significant challenge toward fully
automated driving. Merging vehicles need to decide not only how to merge into a
spot, but also where to merge. We present a method for the freeway merging
based on multi-policy decision making with a reinforcement learning method
called {\em p... | computer science |
37,458 | Online Multi-Armed Bandit | cs.AI | We introduce a novel variant of the multi-armed bandit problem, in which
bandits are streamed one at a time to the player, and at each point, the player
can either choose to pull the current bandit or move on to the next bandit.
Once a player has moved on from a bandit, they may never visit it again, which
is a crucial... | computer science |
37,459 | Latent Relational Metric Learning via Memory-based Attention for
Collaborative Ranking | cs.AI | This paper proposes a new neural architecture for collaborative ranking with
implicit feedback. Our model, LRML (\textit{Latent Relational Metric Learning})
is a novel metric learning approach for recommendation. More specifically,
instead of simple push-pull mechanisms between user and item pairs, we propose
to learn ... | computer science |
37,460 | Computing LPMLN Using ASP and MLN Solvers | cs.AI | LPMLN is a recent addition to probabilistic logic programming languages. Its
main idea is to overcome the rigid nature of the stable model semantics by
assigning a weight to each rule in a way similar to Markov Logic is defined. We
present two implementations of LPMLN, $\text{LPMLN2ASP}$ and
$\text{LPMLN2MLN}$. System ... | computer science |
37,461 | Applying MAPP Algorithm for Cooperative Path Finding in Urban
Environments | cs.AI | The paper considers the problem of planning a set of non-conflict
trajectories for the coalition of intelligent agents (mobile robots). Two
divergent approaches, e.g. centralized and decentralized, are surveyed and
analyzed. Decentralized planner - MAPP is described and applied to the task of
finding trajectories for d... | computer science |
37,462 | On the Computation of Paracoherent Answer Sets | cs.LO | Answer Set Programming (ASP) is a well-established formalism for nonmonotonic
reasoning. An ASP program can have no answer set due to cyclic default
negation. In this case, it is not possible to draw any conclusion, even if this
is not intended. Recently, several paracoherent semantics have been proposed
that address t... | computer science |
37,463 | Towards Real-Time Search Planning in Subsea Environments | cs.RO | We address the challenge of computing search paths in real-time for subsea
applications where the goal is to locate an unknown number of targets on the
seafloor. Our approach maximizes a formal definition of search effectiveness
given finite search effort. We account for false positive measurements and
variation in the... | computer science |
37,464 | Evaluation of Semantic Web Technologies for Storing Computable
Definitions of Electronic Health Records Phenotyping Algorithms | cs.AI | Electronic Health Records are electronic data generated during or as a
byproduct of routine patient care. Structured, semi-structured and unstructured
EHR offer researchers unprecedented phenotypic breadth and depth and have the
potential to accelerate the development of precision medicine approaches at
scale. A main E... | computer science |
37,465 | Relational Learning and Feature Extraction by Querying over
Heterogeneous Information Networks | cs.AI | Many real world systems need to operate on heterogeneous information networks
that consist of numerous interacting components of different types. Examples
include systems that perform data analysis on biological information networks;
social networks; and information extraction systems processing unstructured
data to co... | computer science |
37,466 | Price and Profit Awareness in Recommender Systems | cs.IR | Academic research in the field of recommender systems mainly focuses on the
problem of maximizing the users' utility by trying to identify the most
relevant items for each user. However, such items are not necessarily the ones
that maximize the utility of the service provider (e.g., an online retailer) in
terms of the ... | computer science |
37,467 | Navigability with Imperfect Information | cs.AI | The article studies navigability of an autonomous agent in a maze where some
rooms may be indistinguishable. In a previous work the authors have shown that
the properties of navigability in such a setting depend on whether an agent has
perfect recall. Navigability by an agent with perfect recall is a transitive
relatio... | computer science |
37,468 | The Advantage of Evidential Attributes in Social Networks | cs.AI | Nowadays, there are many approaches designed for the task of detecting
communities in social networks. Among them, some methods only consider the
topological graph structure, while others take use of both the graph structure
and the node attributes. In real-world networks, there are many uncertain and
noisy attributes ... | computer science |
37,469 | Making the best of data derived from a daily practice in clinical legal
medicine for research and practice - the example of Spe3dLab | cs.CY | Forensic science suffers from a lack of studies with high-quality design,
such as randomized controlled trials (RCT). Evidence in forensic science may be
of insufficient quality, which is a major concern. Results from RCT are
criticized for providing artificial results that are not useful in real life
and unfit for ind... | computer science |
37,470 | Guidelines for Artificial Intelligence Containment | cs.AI | With almost daily improvements in capabilities of artificial intelligence it
is more important than ever to develop safety software for use by the AI
research community. Building on our previous work on AI Containment Problem we
propose a number of guidelines which should help AI safety researchers to
develop reliable ... | computer science |
37,471 | Common Knowledge in a Logic of Gossips | cs.LO | Gossip protocols aim at arriving, by means of point-to-point or group
communications, at a situation in which all the agents know each other secrets.
Recently a number of authors studied distributed epistemic gossip protocols.
These protocols use as guards formulas from a simple epistemic logic, which
makes their analy... | computer science |
37,472 | A Logic for Global and Local Announcements | cs.LO | In this paper we introduce {\em global and local announcement logic} (GLAL),
a dynamic epistemic logic with two distinct announcement operators --
$[\phi]^+_A$ and $[\phi]^-_A$ indexed to a subset $A$ of the set $Ag$ of all
agents -- for global and local announcements respectively. The boundary case
$[\phi]^+_{Ag}$ cor... | computer science |
37,473 | Relaxing Exclusive Control in Boolean Games | cs.AI | In the typical framework for boolean games (BG) each player can change the
truth value of some propositional atoms, while attempting to make her goal
true. In standard BG goals are propositional formulas, whereas in iterated BG
goals are formulas of Linear Temporal Logic. Both notions of BG are
characterised by the fac... | computer science |
37,474 | Together We Know How to Achieve: An Epistemic Logic of Know-How
(Extended Abstract) | cs.AI | The existence of a coalition strategy to achieve a goal does not necessarily
mean that the coalition has enough information to know how to follow the
strategy. Neither does it mean that the coalition knows that such a strategy
exists. The paper studies an interplay between the distributed knowledge,
coalition strategie... | computer science |
37,475 | Argument-based Belief in Topological Structures | cs.AI | This paper combines two studies: a topological semantics for epistemic
notions and abstract argumentation theory. In our combined setting, we use a
topological semantics to represent the structure of an agent's collection of
evidence, and we use argumentation theory to single out the relevant sets of
evidence through w... | computer science |
37,476 | Reconciling Bayesian Epistemology and Narration-based Approaches to
Judiciary Fact-finding | cs.AI | Legal probabilism (LP) claims the degrees of conviction in juridical
fact-finding are to be modeled exactly the way degrees of beliefs are modeled
in standard bayesian epistemology. Classical legal probabilism (CLP) adds that
the conviction is justified if the credence in guilt given the evidence is
above an appropriat... | computer science |
37,477 | A New Modal Framework for Epistemic Logic | cs.AI | Recent years witnessed a growing interest in non-standard epistemic logics of
knowing whether, knowing how, knowing what, knowing why and so on. The new
epistemic modalities introduced in those logics all share, in their semantics,
the general schema of $\exists x \Box \phi$, e.g., knowing how to achieve
$\phi$ roughly... | computer science |
37,478 | Toward the Starting Line: A Systems Engineering Approach to Strong AI | cs.AI | Artificial General Intelligence (AGI) or Strong AI aims to create machines
with human-like or human-level intelligence, which is still a very ambitious
goal when compared to the existing computing and AI systems. After many hype
cycles and lessons from AI history, it is clear that a big conceptual leap is
needed for cr... | computer science |
37,479 | Hyperprofile-based Computation Offloading for Mobile Edge Networks | cs.NI | In recent studies, researchers have developed various computation offloading
frameworks for bringing cloud services closer to the user via edge networks.
Specifically, an edge device needs to offload computationally intensive tasks
because of energy and processing constraints. These constraints present the
challenge of... | computer science |
37,480 | Method and apparatus for automatic text input insertion in digital
devices with a restricted number of keys | cs.HC | A device which contains number of symbol input keys, where the number of
available keys is less than the number of symbols of an alphabet of any given
language, screen, and dynamic reordering table of the symbols which are mapped
onto those keys, according to a disambiguation method based on the previously
entered symb... | computer science |
37,481 | Developing Knowledge-enhanced Chronic Disease Risk Prediction Models
from Regional EHR Repositories | cs.AI | Precision medicine requires the precision disease risk prediction models. In
literature, there have been a lot well-established (inter-)national risk
models, but when applying them into the local population, the prediction
performance becomes unsatisfactory. To address the localization issue, this
paper exploits the wa... | computer science |
37,482 | Helping AI to Play Hearthstone: AAIA'17 Data Mining Challenge | cs.AI | This paper summarizes the AAIA'17 Data Mining Challenge: Helping AI to Play
Hearthstone which was held between March 23, and May 15, 2017 at the Knowledge
Pit platform. We briefly describe the scope and background of this competition
in the context of a more general project related to the development of an AI
engine fo... | computer science |
37,483 | Declarative Statistics | cs.AI | In this work we introduce declarative statistics, a suite of declarative
modelling tools for statistical analysis. Statistical constraints represent the
key building block of declarative statistics. First, we introduce a range of
relevant counting and matrix constraints and associated decompositions, some of
which nove... | computer science |
37,484 | Fake News Detection on Social Media: A Data Mining Perspective | cs.SI | Social media for news consumption is a double-edged sword. On the one hand,
its low cost, easy access, and rapid dissemination of information lead people
to seek out and consume news from social media. On the other hand, it enables
the wide spread of "fake news", i.e., low quality news with intentionally false
informat... | computer science |
37,485 | A Framework for Inferring Causality from Multi-Relational Observational
Data using Conditional Independence | cs.DB | The study of causality or causal inference - how much a given treatment
causally affects a given outcome in a population - goes way beyond correlation
or association analysis of variables, and is critical in making sound data
driven decisions and policies in a multitude of applications. The gold standard
in causal infe... | computer science |
37,486 | Robust Computer Algebra, Theorem Proving, and Oracle AI | cs.AI | In the context of superintelligent AI systems, the term "oracle" has two
meanings. One refers to modular systems queried for domain-specific tasks.
Another usage, referring to a class of systems which may be useful for
addressing the value alignment and AI control problems, is a superintelligent
AI system that only ans... | computer science |
37,487 | Role of Secondary Attributes to Boost the Prediction Accuracy of
Students Employability Via Data Mining | cs.CY | Data Mining is best-known for its analytical and prediction capabilities. It
is used in several areas such as fraud detection, predicting client behavior,
money market behavior, bankruptcy prediction. It can also help in establishing
an educational ecosystem, which discovers useful knowledge, and assist
educators to ta... | computer science |
37,488 | The Static and Stochastic VRPTW with both random Customers and Reveal
Times: algorithms and recourse strategies | cs.AI | Unlike its deterministic counterpart, static and stochastic vehicle routing
problems (SS-VRP) aim at modeling and solving real-life operational problems by
considering uncertainty on data. We consider the SS-VRPTW-CR introduced in
Saint-Guillain et al. (2017). Like the SS-VRP introduced by Bertsimas (1992),
we search f... | computer science |
37,489 | Preference fusion and Condorcet's Paradox under uncertainty | cs.AI | Facing an unknown situation, a person may not be able to firmly elicit
his/her preferences over different alternatives, so he/she tends to express
uncertain preferences. Given a community of different persons expressing their
preferences over certain alternatives under uncertainty, to get a collective
representative op... | computer science |
37,490 | Optimizing Gross Merchandise Volume via DNN-MAB Dynamic Ranking Paradigm | cs.AI | With the transition from people's traditional `brick-and-mortar' shopping to
online mobile shopping patterns in web 2.0 $\mathit{era}$, the recommender
system plays a critical role in E-Commerce and E-Retails. This is especially
true when designing this system for more than $\mathbf{236~million}$ daily
active users. Ra... | computer science |
37,491 | Counterexample Guided Inductive Optimization Applied to Mobile Robots
Path Planning (Extended Version) | cs.RO | We describe and evaluate a novel optimization-based off-line path planning
algorithm for mobile robots based on the Counterexample-Guided Inductive
Optimization (CEGIO) technique. CEGIO iteratively employs counterexamples
generated from Boolean Satisfiability (SAT) and Satisfiability Modulo Theories
(SMT) solvers, in o... | computer science |
37,492 | Deep Reinforcement Learning for High Precision Assembly Tasks | cs.RO | High precision assembly of mechanical parts requires accuracy exceeding the
robot precision. Conventional part mating methods used in the current
manufacturing requires tedious tuning of numerous parameters before deployment.
We show how the robot can successfully perform a tight clearance peg-in-hole
task through trai... | computer science |
37,493 | A scalable multi-core architecture with heterogeneous memory structures
for Dynamic Neuromorphic Asynchronous Processors (DYNAPs) | cs.AR | Neuromorphic computing systems comprise networks of neurons that use
asynchronous events for both computation and communication. This type of
representation offers several advantages in terms of bandwidth and power
consumption in neuromorphic electronic systems. However, managing the traffic
of asynchronous events in l... | computer science |
37,494 | Motion Planning under Partial Observability using Game-Based Abstraction | cs.RO | We study motion planning problems where agents move inside environments that
are not fully observable and subject to uncertainties. The goal is to compute a
strategy for an agent that is guaranteed to satisfy certain safety and
performance specifications. Such problems are naturally modelled by partially
observable Mar... | computer science |
37,495 | Learning body-affordances to simplify action spaces | cs.AI | Controlling embodied agents with many actuated degrees of freedom is a
challenging task. We propose a method that can discover and interpolate between
context dependent high-level actions or body-affordances. These provide an
abstract, low-dimensional interface indexing high-dimensional and time-
extended action polici... | computer science |
37,496 | Multi-task Neural Network for Non-discrete Attribute Prediction in
Knowledge Graphs | cs.AI | Many popular knowledge graphs such as Freebase, YAGO or DBPedia maintain a
list of non-discrete attributes for each entity. Intuitively, these attributes
such as height, price or population count are able to richly characterize
entities in knowledge graphs. This additional source of information may help to
alleviate th... | computer science |
37,497 | Warp: a method for neural network interpretability applied to gene
expression profiles | cs.AI | We show a proof of principle for warping, a method to interpret the inner
working of neural networks in the context of gene expression analysis. Warping
is an efficient way to gain insight to the inner workings of neural nets and
make them more interpretable. We demonstrate the ability of warping to recover
meaningful ... | computer science |
37,498 | Human Uncertainty and Ranking Error -- The Secret of Successful
Evaluation in Predictive Data Mining | cs.HC | One of the most crucial issues in data mining is to model human behaviour in
order to provide personalisation, adaptation and recommendation. This usually
involves implicit or explicit knowledge, either by observing user interactions,
or by asking users directly. But these sources of information are always
subject to t... | computer science |
37,499 | Software-Defined Robotics -- Idea & Approach | cs.RO | The methodology of Software-Defined Robotics hierarchical-based and
stand-alone framework can be designed and implemented to program and control
different sets of robots, regardless of their manufacturers' parameters and
specifications, with unified commands and communications. This framework
approach will increase the... | computer science |
37,500 | Network Model Selection for Task-Focused Attributed Network Inference | cs.SI | Networks are models representing relationships between entities. Often these
relationships are explicitly given, or we must learn a representation which
generalizes and predicts observed behavior in underlying individual data (e.g.
attributes or labels). Whether given or inferred, choosing the best
representation affec... | computer science |
37,501 | The Continuous Hint Factory - Providing Hints in Vast and Sparsely
Populated Edit Distance Spaces | cs.AI | Intelligent tutoring systems can support students in solving multi-step tasks
by providing a hint regarding what to do next. However, engineering such
next-step hints manually or using an expert model becomes infeasible if the
space of possible states is too large. Therefore, several approaches have
emerged to infer ne... | computer science |
37,502 | Software engineering and the SP theory of intelligence | cs.SE | This paper describes a novel approach to software engineering derived from
the "SP theory of intelligence" and its realisation in the "SP computer model".
These are the bases of a projected industrial-strength "SP machine" which, when
mature, is anticipated to be the vehicle for software engineering as described
in thi... | computer science |
37,503 | Capturing Long-term Temporal Dependencies with Convolutional Networks
for Continuous Emotion Recognition | cs.SD | The goal of continuous emotion recognition is to assign an emotion value to
every frame in a sequence of acoustic features. We show that incorporating
long-term temporal dependencies is critical for continuous emotion recognition
tasks. To this end, we first investigate architectures that use dilated
convolutions. We s... | computer science |
37,504 | Finding Streams in Knowledge Graphs to Support Fact Checking | cs.AI | The volume and velocity of information that gets generated online limits
current journalistic practices to fact-check claims at the same rate.
Computational approaches for fact checking may be the key to help mitigate the
risks of massive misinformation spread. Such approaches can be designed to not
only be scalable an... | computer science |
37,505 | Area Protection in Adversarial Path-Finding Scenarios with Multiple
Mobile Agents on Graphs: a theoretical and experimental study of
target-allocation strategies for defense coordination | cs.AI | We address a problem of area protection in graph-based scenarios with
multiple agents. The problem consists of two adversarial teams of agents that
move in an undirected graph shared by both teams. Agents are placed in vertices
of the graph; at most one agent can occupy a vertex; and they can move into
adjacent vertice... | computer science |
37,506 | Achieving Proportional Representation via Voting | cs.GT | Proportional representation (PR) is often discussed in voting settings as a
major desideratum. For the past century or so, it is common both in practice
and in the academic literature to jump to STV (Single Transferable Vote) as the
solution for achieving PR. Some of the most prominent electoral reform
movements around... | computer science |
37,507 | Reinforcement Mechanism Design for e-commerce | cs.MA | We study the problem of allocating impressions to sellers in e-commerce
websites, such as Amazon, eBay or Taobao, aiming to maximize the total revenue
generated by the platform. We employ a general framework of reinforcement
mechanism design, which uses deep reinforcement learning to design efficient
algorithms, taking... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.