Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
36,207 | Analysis of Optimization Techniques to Improve User Response Time of Web
Applications and Their Implementation for MOODLE | cs.AI | Analysis of seven optimization techniques grouped under three categories
(hardware, back-end, and front-end) is done to study the reduction in average
user response time for Modular Object Oriented Dynamic Learning Environment
(Moodle), a Learning Management System which is scripted in PHP5, runs on
Apache web server a... | computer science |
36,208 | HeteSim: A General Framework for Relevance Measure in Heterogeneous
Networks | cs.IR | Similarity search is an important function in many applications, which
usually focuses on measuring the similarity between objects with the same type.
However, in many scenarios, we need to measure the relatedness between objects
with different types. With the surge of study on heterogeneous networks, the
relevance mea... | computer science |
36,209 | A Model of the Mechanisms Underlying Exploratory Behaviour | cs.AI | A model of the mechanisms underlying exploratory behaviour, based on
empirical research and refined using a computer simulation, is presented. The
behaviour of killifish from two lakes, one with killifish predators and one
without, was compared in the laboratory. Plotting average activity in a novel
environment versus ... | computer science |
36,210 | Concept Combination and the Origins of Complex Cognition | cs.AI | At the core of our uniquely human cognitive abilities is the capacity to see
things from different perspectives, or to place them in a new context. We
propose that this was made possible by two cognitive transitions. First, the
large brain of Homo erectus facilitated the onset of recursive recall: the
ability to string... | computer science |
36,211 | Estimating the Margin of Victory of an Election using Sampling | cs.AI | The margin of victory of an election is a useful measure to capture the
robustness of an election outcome. It also plays a crucial role in determining
the sample size of various algorithms in post election audit, polling etc. In
this work, we present efficient sampling based algorithms for estimating the
margin of vict... | computer science |
36,212 | Structure Formation in Large Theories | cs.LO | Structuring theories is one of the main approaches to reduce the
combinatorial explosion associated with reasoning and exploring large theories.
In the past we developed the notion of development graphs as a means to
represent and maintain structured theories. In this paper we present a
methodology and a resulting impl... | computer science |
36,213 | DistMS: A Non-Portfolio Distributed Solver for Maximum Satisfiability | cs.LO | The most successful parallel SAT and MaxSAT solvers follow a portfolio
approach, where each thread applies a different algorithm (or the same
algorithm configured differently) to solve a given problem instance. The main
goal of building a portfolio is to diversify the search process being carried
out by each thread. As... | computer science |
36,214 | Exploring Strategy-Proofness, Uniqueness, and Pareto Optimality for the
Stable Matching Problem with Couples | cs.GT | The Stable Matching Problem with Couples (SMP-C) is a ubiquitous real-world
extension of the stable matching problem (SMP) involving complementarities.
Although SMP can be solved in polynomial time, SMP-C is NP-Complete. Hence, it
is not clear which, if any, of the theoretical results surrounding the
canonical SMP prob... | computer science |
36,215 | Predicting Occupancy Trends in Barcelona's Bicycle Service Stations
Using Open Data | cs.AI | In 2008, the CEO of the company that manages and maintains the public bicycle
service in Barcelona recognized that one may not expect to always find a place
to leave the rented bike nearby their destination, similarly to the case when,
driving a car, people may not find a parking lot. In this work, we make
predictions ... | computer science |
36,216 | A Theory of Formal Synthesis via Inductive Learning | cs.AI | Formal synthesis is the process of generating a program satisfying a
high-level formal specification. In recent times, effective formal synthesis
methods have been proposed based on the use of inductive learning. We refer to
this class of methods that learn programs from examples as formal inductive
synthesis. In this ... | computer science |
36,217 | Norm Monitoring under Partial Action Observability | cs.MA | In the context of using norms for controlling multi-agent systems, a vitally
important question that has not yet been addressed in the literature is the
development of mechanisms for monitoring norm compliance under partial action
observability. This paper proposes the reconstruction of unobserved actions to
tackle thi... | computer science |
36,218 | How, What and Why to test an ontology | cs.AI | Ontology development relates to software development in that they both
involve the production of formal computational knowledge. It is possible,
therefore, that some of the techniques used in software engineering could also
be used for ontologies; for example, in software engineering testing is a
well-established proce... | computer science |
36,219 | Scalable Parallel Numerical Constraint Solver Using Global Load
Balancing | cs.DC | We present a scalable parallel solver for numerical constraint satisfaction
problems (NCSPs). Our parallelization scheme consists of homogeneous worker
solvers, each of which runs on an available core and communicates with others
via the global load balancing (GLB) method. The parallel solver is implemented
with X10 th... | computer science |
36,220 | Advances in Artificial Intelligence: Deep Intentions, Shallow
Achievements | cs.AI | Over the past decade, AI has made a remarkable progress due to recently
revived Deep Learning technology. Deep Learning enables to process large
amounts of data using simplified neuron networks that simulate the way in which
the brain works. At the same time, there is another point of view that posits
that brain is pro... | computer science |
36,221 | Recursion in RDF Data Shape Languages | cs.DB | An RDF data shape is a description of the expected contents of an RDF
document (aka graph) or dataset. A major part of this description is the set of
constraints that the document or dataset is required to satisfy. W3C recently
(2014) chartered the RDF Data Shapes Working Group to define SHACL, a standard
RDF data shap... | computer science |
36,222 | A New Fundamental Evidence of Non-Classical Structure in the Combination
of Natural Concepts | cs.AI | We recently performed cognitive experiments on conjunctions and negations of
two concepts with the aim of investigating the combination problem of concepts.
Our experiments confirmed the deviations (conceptual vagueness, underextension,
overextension, etc.) from the rules of classical (fuzzy) logic and probability
theo... | computer science |
36,223 | Modular Action Language ALM | cs.LO | The paper introduces a new modular action language, ALM, and illustrates the
methodology of its use. It is based on the approach of Gelfond and Lifschitz
(1993; 1998) in which a high-level action language is used as a front end for a
logic programming system description. The resulting logic programming
representation i... | computer science |
36,224 | A Pareto Front-Based Multiobjective Path Planning Algorithm | cs.AI | Path planning is one of the most vital elements of mobile robotics. With a
priori knowledge of the environment, global path planning provides a
collision-free route through the workspace. The global path plan can be
calculated with a variety of informed search algorithms, most notably the A*
search method, guaranteed t... | computer science |
36,225 | A survey of SMS based Information Systems | cs.AI | Short Message Service (SMS) based Information Systems (SMSbIS) provide an
excellent alternative to a traditional approach of obtaining specific
information by direct (through phone) or indirect (IVRS, Web, Email) probing.
Information and communication technology and far reaching mobile penetration
has opened this new r... | computer science |
36,226 | A Logic of Knowing How | cs.AI | In this paper, we propose a single-agent modal logic framework for reasoning
about goal-direct "knowing how" based on ideas from linguistics, philosophy,
modal logic and automated planning. We first define a modal language to express
"I know how to guarantee phi given psi" with a semantics not based on standard
epistem... | computer science |
36,227 | Fair task allocation in transportation | cs.AI | Task allocation problems have traditionally focused on cost optimization.
However, more and more attention is being given to cases in which cost should
not always be the sole or major consideration. In this paper we study a fair
task allocation problem in transportation where an optimal allocation not only
has low cost... | computer science |
36,228 | Multidefender Security Games | cs.GT | Stackelberg security game models and associated computational tools have seen
deployment in a number of high-consequence security settings, such as LAX
canine patrols and Federal Air Marshal Service. These models focus on isolated
systems with only one defender, despite being part of a more complex system
with multiple... | computer science |
36,229 | Relations between assumption-based approaches in nonmonotonic logic and
formal argumentation | cs.AI | In this paper we make a contribution to the unification of formal models of
defeasible reasoning. We present several translations between formal
argumentation frameworks and nonmonotonic logics for reasoning with plausible
assumptions. More specifically, we translate adaptive logics into
assumption-based argumentation ... | computer science |
36,230 | The Algorithm of Islamic Jurisprudence (Fiqh) with Validation of an
Entscheidungsproblem | cs.AI | The historic background of algorithmic processing with regard to etymology
and methodology is translated into terms of mathematical logic and Computer
Science. A formal logic structure is introduced by exemplaryquestions posed to
Fiqh-chapters to define alogic query language. As a foundation, ageneric
algorithm for dec... | computer science |
36,231 | Improving SAT Solvers via Blocked Clause Decomposition | cs.LO | The decision variable selection policy used by the most competitive CDCL
(Conflict-Driven Clause Learning) SAT solvers is either VSIDS (Variable State
Independent Decaying Sum) or its variants such as exponential version EVSIDS.
The common characteristic of VSIDS and its variants is to make use of
statistical informati... | computer science |
36,232 | Bicycle-Sharing System Analysis and Trip Prediction | cs.CY | Bicycle-sharing systems, which can provide shared bike usage services for the
public, have been launched in many big cities. In bicycle-sharing systems,
people can borrow and return bikes at any stations in the service region very
conveniently. Therefore, bicycle-sharing systems are normally used as a
short-distance tr... | computer science |
36,233 | Asking the metaquestions in constraint tractability | cs.CC | The constraint satisfaction problem (CSP) involves deciding, given a set of
variables and a set of constraints on the variables, whether or not there is an
assignment to the variables satisfying all of the constraints. One formulation
of the CSP is as the problem of deciding, given a pair (G,H) of relational
structures... | computer science |
36,234 | A Mathematical Trust Algebra for International Nation Relations
Computation and Evaluation | cs.CR | This paper presents a trust computation for international relations and its
calculus, which related to Bayesian inference, Dempster Shafer theory and
subjective logic. We proposed a method that allows a trust computation which is
previously subjective and incomputable. An example of case study for the trust
computation... | computer science |
36,235 | An Efficient Algorithm for Mining Frequent Sequence with Constraint
Programming | cs.DB | The main advantage of Constraint Programming (CP) approaches for sequential
pattern mining (SPM) is their modularity, which includes the ability to add new
constraints (regular expressions, length restrictions, etc). The current best
CP approach for SPM uses a global constraint (module) that computes the
projected data... | computer science |
36,236 | Efficiency and Sequenceability in Fair Division of Indivisible Goods
with Additive Preferences | cs.GT | In fair division of indivisible goods, using sequences of sincere choices (or
picking sequences) is a natural way to allocate the objects. The idea is the
following: at each stage, a designated agent picks one object among those that
remain. This paper, restricted to the case where the agents have numerical
additive pr... | computer science |
36,237 | Planning with Information-Processing Constraints and Model Uncertainty
in Markov Decision Processes | cs.AI | Information-theoretic principles for learning and acting have been proposed
to solve particular classes of Markov Decision Problems. Mathematically, such
approaches are governed by a variational free energy principle and allow
solving MDP planning problems with information-processing constraints expressed
in terms of a... | computer science |
36,238 | Differential Evolution for Efficient AUV Path Planning in Time Variant
Uncertain Underwater Environment | cs.RO | The AUV three-dimension path planning in complex turbulent underwater
environment is investigated in this research, in which static current map data
and uncertain static-moving time variant obstacles are taken into account.
Robustness of AUVs path planning to this strong variability is known as a
complex NP-hard proble... | computer science |
36,239 | Optimal Route Planning with Prioritized Task Scheduling for AUV Missions | cs.RO | This paper presents a solution to Autonomous Underwater Vehicles (AUVs) large
scale route planning and task assignment joint problem. Given a set of
constraints (e.g., time) and a set of task priority values, the goal is to find
the optimal route for underwater mission that maximizes the sum of the
priorities and minim... | computer science |
36,240 | Backward-Forward Search for Manipulation Planning | cs.RO | In this paper we address planning problems in high-dimensional hybrid
configuration spaces, with a particular focus on manipulation planning problems
involving many objects. We present the hybrid backward-forward (HBF) planning
algorithm that uses a backward identification of constraints to direct the
sampling of the i... | computer science |
36,241 | Spatiotemporal Articulated Models for Dynamic SLAM | cs.RO | We propose an online spatiotemporal articulation model estimation framework
that estimates both articulated structure as well as a temporal prediction
model solely using passive observations. The resulting model can predict future
mo- tions of an articulated object with high confidence because of the spatial
and tempor... | computer science |
36,242 | HordeQBF: A Modular and Massively Parallel QBF Solver | cs.LO | The recently developed massively parallel satisfiability (SAT) solver
HordeSAT was designed in a modular way to allow the integration of any
sequential CDCL-based SAT solver in its core. We integrated the QCDCL-based
quantified Boolean formula (QBF) solver DepQBF in HordeSAT to obtain a
massively parallel QBF solver---... | computer science |
36,243 | A Deterministic Annealing Approach to the Multiple Traveling Salesmen
and Related Problems | math.OC | This paper presents a novel and efficient heuristic framework for
approximating the solutions to the multiple traveling salesmen problem (m-TSP)
and other variants on the TSP. The approach adopted in this paper is an
extension of the Maximum-Entropy-Principle (MEP) and the Deterministic
Annealing (DA) algorithm. The fr... | computer science |
36,244 | Tasks for agent-based negotiation teams: Analysis, review, and
challenges | cs.MA | An agent-based negotiation team is a group of interdependent agents that join
together as a single negotiation party due to their shared interests in the
negotiation at hand. The reasons to employ an agent-based negotiation team may
vary: (i) more computation and parallelization capabilities, (ii) unite agents
with dif... | computer science |
36,245 | Studying the impact of negotiation environments on negotiation teams'
performance | cs.MA | In this article we study the impact of the negotiation environment on the
performance of several intra-team strategies (team dynamics) for agent-based
negotiation teams that negotiate with an opponent. An agent-based negotiation
team is a group of agents that joins together as a party because they share
common interest... | computer science |
36,246 | Toward Efficient Task Assignment and Motion Planning for Large Scale
Underwater Mission | cs.RO | An Autonomous Underwater Vehicle (AUV) needs to acquire a certain degree of
autonomy for any particular underwater mission to fulfill the mission
objectives successfully and ensure its safety in all stages of the mission in a
large scale operating filed. In this paper, a novel combinatorial
conflict-free-task assignmen... | computer science |
36,247 | A global constraint for closed itemset mining | cs.AI | Discovering the set of closed frequent patterns is one of the fundamental
problems in Data Mining. Recent Constraint Programming (CP) approaches for
declarative itemset mining have proven their usefulness and flexibility. But
the wide use of reified constraints in current CP approaches raises many
difficulties to cope ... | computer science |
36,248 | Text-based LSTM networks for Automatic Music Composition | cs.AI | In this paper, we introduce new methods and discuss results of text-based
LSTM (Long Short-Term Memory) networks for automatic music composition. The
proposed network is designed to learn relationships within text documents that
represent chord progressions and drum tracks in two case studies. In the
experiments, word-... | computer science |
36,249 | Managing Overstaying Electric Vehicles in Park-and-Charge Facilities | cs.AI | With the increase in adoption of Electric Vehicles (EVs), proper utilization
of the charging infrastructure is an emerging challenge for service providers.
Overstaying of an EV after a charging event is a key contributor to low
utilization. Since overstaying is easily detectable by monitoring the power
drawn from the c... | computer science |
36,250 | Demand Prediction and Placement Optimization for Electric Vehicle
Charging Stations | cs.AI | Effective placement of charging stations plays a key role in Electric Vehicle
(EV) adoption. In the placement problem, given a set of candidate sites, an
optimal subset needs to be selected with respect to the concerns of both (a)
the charging station service provider, such as the demand at the candidate
sites and the ... | computer science |
36,251 | Pattern-Based Approach to the Workflow Satisfiability Problem with
User-Independent Constraints | cs.AI | The fixed parameter tractable (FPT) approach is a powerful tool in tackling
computationally hard problems. In this paper, we link FPT results to classic
artificial intelligence (AI) techniques to show how they complement each other.
Specifically, we consider the workflow satisfiability problem (WSP) which asks
whether ... | computer science |
36,252 | Using Reinforcement Learning to Validate Empirical Game-Theoretic
Analysis: A Continuous Double Auction Study | cs.AI | Empirical game-theoretic analysis (EGTA) has recently been applied
successfully to analyze the behavior of large numbers of competing traders in a
continuous double auction market. Multiagent simulation methods like EGTA are
useful for studying complex strategic environments like a stock market, where
it is not feasibl... | computer science |
36,253 | Parameterized Compilation Lower Bounds for Restricted CNF-formulas | cs.AI | We show unconditional parameterized lower bounds in the area of knowledge
compilation, more specifically on the size of circuits in decomposable negation
normal form (DNNF) that encode CNF-formulas restricted by several graph width
measures. In particular, we show that
- there are CNF formulas of size $n$ and modular... | computer science |
36,254 | A Hybrid Approach to Query Answering under Expressive Datalog+/- | cs.DB | Datalog+/- is a family of ontology languages that combine good computational
properties with high expressive power. Datalog+/- languages are provably able
to capture the most relevant Semantic Web languages. In this paper we consider
the class of weakly-sticky (WS) Datalog+/- programs, which allow for certain
useful fo... | computer science |
36,255 | Extracted Social Network Mining | cs.SI | In this paper we study the relationship between the resources of social
networks by exploring the Web as big data based on a simple search engine. We
have used set theory by utilizing the occurrence and co-occurrence for defining
the singleton or doubleton spaces of event in a search engine model, and then
provided the... | computer science |
36,256 | The Dichotomy for Conservative Constraint Satisfaction is Polynomially
Decidable | cs.CC | Given a fixed constraint language $\Gamma$, the conservative CSP over
$\Gamma$ (denoted by c-CSP($\Gamma$)) is a variant of CSP($\Gamma$) where the
domain of each variable can be restricted arbitrarily. A dichotomy is known for
conservative CSP: for every fixed language $\Gamma$, c-CSP($\Gamma$) is either
in P or NP-co... | computer science |
36,257 | Predictive No-Reference Assessment of Video Quality | cs.MM | Among the various means to evaluate the quality of video streams,
No-Reference (NR) methods have low computation and may be executed on thin
clients. Thus, NR algorithms would be perfect candidates in cases of real-time
quality assessment, automated quality control and, particularly, in adaptive
mobile streaming. Yet, ... | computer science |
36,258 | Procedural Generation of Angry Birds Levels using Building Constructive
Grammar with Chinese-Style and/or Japanese-Style Models | cs.AI | This paper presents a procedural generation method that creates visually
attractive levels for the Angry Birds game. Besides being an immensely popular
mobile game, Angry Birds has recently become a test bed for various artificial
intelligence technologies. We propose a new approach for procedurally
generating Angry Bi... | computer science |
36,259 | The Power of Arc Consistency for CSPs Defined by Partially-Ordered
Forbidden Patterns | cs.CC | Characterising tractable fragments of the constraint satisfaction problem
(CSP) is an important challenge in theoretical computer science and artificial
intelligence. Forbidding patterns (generic sub-instances) provides a means of
defining CSP fragments which are neither exclusively language-based nor
exclusively struc... | computer science |
36,260 | Propositional Abduction with Implicit Hitting Sets | cs.AI | Logic-based abduction finds important applications in artificial intelligence
and related areas. One application example is in finding explanations for
observed phenomena. Propositional abduction is a restriction of abduction to
the propositional domain, and complexity-wise is in the second level of the
polynomial hier... | computer science |
36,261 | Quantum Cognition Beyond Hilbert Space I: Fundamentals | cs.AI | The formalism of quantum theory in Hilbert space has been applied with
success to the modeling and explanation of several cognitive phenomena, whereas
traditional cognitive approaches were problematical. However, this 'quantum
cognition paradigm' was recently challenged by its proven impossibility to
simultaneously mod... | computer science |
36,262 | Quantum cognition beyond Hilbert space II: Applications | cs.AI | The research on human cognition has recently benefited from the use of the
mathematical formalism of quantum theory in Hilbert space. However, cognitive
situations exist which indicate that the Hilbert space structure, and the
associated Born rule, would be insufficient to provide a satisfactory modeling
of the collect... | computer science |
36,263 | Semantic Reasoning for Context-aware Internet of Things Applications | cs.AI | Advances in ICT are bringing into reality the vision of a large number of
uniquely identifiable, interconnected objects and things that gather
information from diverse physical environments and deliver the information to a
variety of innovative applications and services. These sensing objects and
things form the Intern... | computer science |
36,264 | Mysteries of Visual Experience | cs.AI | Science is a crowning glory of the human spirit and its applications remain
our best hope for social progress. But there are limitations to current science
and perhaps to any science. The general mind-body problem is known to be
intractable and currently mysterious. This is one of many deep problems that
are universall... | computer science |
36,265 | "Knowing value" logic as a normal modal logic | cs.AI | Recent years witness a growing interest in nonstandard epistemic logics of
"knowing whether", "knowing what", "knowing how", and so on. These logics are
usually not normal, i.e., the standard axioms and reasoning rules for modal
logic may be invalid. In this paper, we show that the conditional "knowing
value" logic pro... | computer science |
36,266 | Supervisory Control for Behavior Composition | cs.AI | We relate behavior composition, a synthesis task studied in AI, to
supervisory control theory from the discrete event systems field. In
particular, we show that realizing (i.e., implementing) a target behavior
module (e.g., a house surveillance system) by suitably coordinating a
collection of available behaviors (e.g.,... | computer science |
36,267 | Text Modeling using Unsupervised Topic Models and Concept Hierarchies | cs.AI | Statistical topic models provide a general data-driven framework for
automated discovery of high-level knowledge from large collections of text
documents. While topic models can potentially discover a broad range of themes
in a data set, the interpretability of the learned topics is not always ideal.
Human-defined conc... | computer science |
36,268 | Initial Results on the F-logic to OWL Bi-directional Translation on a
Tabled Prolog Engine | cs.AI | In this paper, we show our results on the bi-directional data exchange
between the F-logic language supported by the Flora2 system and the OWL
language. Most of the TBox and ABox axioms are translated preserving the
semantics between the two representations, such as: proper inclusion,
individual definition, functional ... | computer science |
36,269 | e-Valuate: A Two-player Game on Arithmetic Expressions -- An Update | math.CO | e-Valuate is a game on arithmetic expressions. The players have contrasting
roles of maximizing and minimizing the given expression. The maximizer proposes
values and the minimizer substitutes them for variables of his choice. When the
expression is fully instantiated, its value is compared with a certain minimax
value... | computer science |
36,270 | OWL: Yet to arrive on the Web of Data? | cs.DL | Seven years on from OWL becoming a W3C recommendation, and two years on from
the more recent OWL 2 W3C recommendation, OWL has still experienced only patchy
uptake on the Web. Although certain OWL features (like owl:sameAs) are very
popular, other features of OWL are largely neglected by publishers in the
Linked Data w... | computer science |
36,271 | Modification of the Elite Ant System in Order to Avoid Local Optimum
Points in the Traveling Salesman Problem | cs.AI | This article presents a new algorithm which is a modified version of the
elite ant system (EAS) algorithm. The new version utilizes an effective
criterion for escaping from the local optimum points. In contrast to the
classical EAC algorithms, the proposed algorithm uses only a global updating,
which will increase pher... | computer science |
36,272 | Optimization in SMT with LA(Q) Cost Functions | cs.AI | In the contexts of automated reasoning and formal verification, important
decision problems are effectively encoded into Satisfiability Modulo Theories
(SMT). In the last decade efficient SMT solvers have been developed for several
theories of practical interest (e.g., linear arithmetic, arrays, bit-vectors).
Surprisin... | computer science |
36,273 | Message passing for quantified Boolean formulas | cs.AI | We introduce two types of message passing algorithms for quantified Boolean
formulas (QBF). The first type is a message passing based heuristics that can
prove unsatisfiability of the QBF by assigning the universal variables in such
a way that the remaining formula is unsatisfiable. In the second type, we use
message p... | computer science |
36,274 | Citizen Science: Contributions to Astronomy Research | cs.AI | The contributions of everyday individuals to significant research has grown
dramatically beyond the early days of classical birdwatching and endeavors of
amateurs of the 19th century. Now people who are casually interested in science
can participate directly in research covering diverse scientific fields.
Regarding ast... | computer science |
36,275 | Decentralized Multi-agent Plan Repair in Dynamic Environments | cs.AI | Achieving joint objectives by teams of cooperative planning agents requires
significant coordination and communication efforts. For a single-agent system
facing a plan failure in a dynamic environment, arguably, attempts to repair
the failed plan in general do not straightforwardly bring any benefit in terms
of time co... | computer science |
36,276 | Refinement Modal Logic | cs.LO | In this paper we present {\em refinement modal logic}. A refinement is like a
bisimulation, except that from the three relational requirements only `atoms'
and `back' need to be satisfied. Our logic contains a new operator 'all' in
addition to the standard modalities 'box' for each agent. The operator 'all'
acts as a q... | computer science |
36,277 | Towards quantitative measures in applied ontology | cs.AI | Applied ontology is a relatively new field which aims to apply theories and
methods from diverse disciplines such as philosophy, cognitive science,
linguistics and formal logics to perform or improve domain-specific tasks. To
support the development of effective research methodologies for applied
ontology, we criticall... | computer science |
36,278 | Solving Cooperative Reliability Games | cs.GT | Cooperative games model the allocation of profit from joint actions,
following considerations such as stability and fairness. We propose the
reliability extension of such games, where agents may fail to participate in
the game. In the reliability extension, each agent only "survives" with a
certain probability, and a c... | computer science |
36,279 | Factored Filtering of Continuous-Time Systems | cs.SY | We consider filtering for a continuous-time, or asynchronous, stochastic
system where the full distribution over states is too large to be stored or
calculated. We assume that the rate matrix of the system can be compactly
represented and that the belief distribution is to be approximated as a product
of marginals. The... | computer science |
36,280 | Filtered Fictitious Play for Perturbed Observation Potential Games and
Decentralised POMDPs | cs.GT | Potential games and decentralised partially observable MDPs (Dec-POMDPs) are
two commonly used models of multi-agent interaction, for static optimisation
and sequential decisionmaking settings, respectively. In this paper we
introduce filtered fictitious play for solving repeated potential games in
which each player's ... | computer science |
36,281 | A Framework for Optimizing Paper Matching | cs.IR | At the heart of many scientific conferences is the problem of matching
submitted papers to suitable reviewers. Arriving at a good assignment is a
major and important challenge for any conference organizer. In this paper we
propose a framework to optimize paper-to-reviewer assignments. Our framework
uses suitability sco... | computer science |
36,282 | Strictly Proper Mechanisms with Cooperating Players | cs.GT | Prediction markets provide an efficient means to assess uncertain quantities
from forecasters. Traditional and competitive strictly proper scoring rules
have been shown to incentivize players to provide truthful probabilistic
forecasts. However, we show that when those players can cooperate, these
mechanisms can instea... | computer science |
36,283 | Efficient Inference in Markov Control Problems | cs.SY | Markov control algorithms that perform smooth, non-greedy updates of the
policy have been shown to be very general and versatile, with policy gradient
and Expectation Maximisation algorithms being particularly popular. For these
algorithms, marginal inference of the reward weighted trajectory distribution
is required t... | computer science |
36,284 | Dynamic Mechanism Design for Markets with Strategic Resources | cs.GT | The assignment of tasks to multiple resources becomes an interesting game
theoretic problem, when both the task owner and the resources are strategic. In
the classical, nonstrategic setting, where the states of the tasks and
resources are observable by the controller, this problem is that of finding an
optimal policy f... | computer science |
36,285 | Price Updating in Combinatorial Prediction Markets with Bayesian
Networks | cs.GT | To overcome the #P-hardness of computing/updating prices in logarithm market
scoring rule-based (LMSR-based) combinatorial prediction markets, Chen et al.
[5] recently used a simple Bayesian network to represent the prices of
securities in combinatorial predictionmarkets for tournaments, and showed that
two types of po... | computer science |
36,286 | The Structure of Signals: Causal Interdependence Models for Games of
Incomplete Information | cs.GT | Traditional economic models typically treat private information, or signals,
as generated from some underlying state. Recent work has explicated alternative
models, where signals correspond to interpretations of available information.
We show that the difference between these formulations can be sharply cast in
terms o... | computer science |
36,287 | Belief Propagation by Message Passing in Junction Trees: Computing Each
Message Faster Using GPU Parallelization | cs.AI | Compiling Bayesian networks (BNs) to junction trees and performing belief
propagation over them is among the most prominent approaches to computing
posteriors in BNs. However, belief propagation over junction tree is known to
be computationally intensive in the general case. Its complexity may increase
dramatically wit... | computer science |
36,288 | Comparing SVM and Naive Bayes classifiers for text categorization with
Wikitology as knowledge enrichment | cs.AI | The activity of labeling of documents according to their content is known as
text categorization. Many experiments have been carried out to enhance text
categorization by adding background knowledge to the document using knowledge
repositories like Word Net, Open Project Directory (OPD), Wikipedia and
Wikitology. In ou... | computer science |
36,289 | Towards an efficient prover for the C1 paraconsistent logic | cs.LO | The KE inference system is a tableau method developed by Marco Mondadori
which was presented as an improvement, in the computational efficiency sense,
over Analytic Tableaux. In the literature, there is no description of a theorem
prover based on the KE method for the C1 paraconsistent logic. Paraconsistent
logics have... | computer science |
36,290 | Perception Lie Paradox: Mathematically Proved Uncertainty about Humans
Perception Similarity | cs.AI | Agents' judgment depends on perception and previous knowledge. Assuming that
previous knowledge depends on perception, we can say that judgment depends on
perception. So, if judgment depends on perception, can agents judge that they
have the same perception? In few words, this is the addressed paradox through
this docu... | computer science |
36,291 | $Q$- and $A$-Learning Methods for Estimating Optimal Dynamic Treatment
Regimes | stat.ME | In clinical practice, physicians make a series of treatment decisions over
the course of a patient's disease based on his/her baseline and evolving
characteristics. A dynamic treatment regime is a set of sequential decision
rules that operationalizes this process. Each rule corresponds to a decision
point and dictates ... | computer science |
36,292 | MAV Stabilization using Machine Learning and Onboard Sensors | cs.RO | In many situations, Miniature Aerial Vehicles (MAVs) are limited to using
only on-board sensors for navigation. This limits the data available to
algorithms used for stabilization and localization, and current control methods
are often insufficient to allow reliable hovering in place or trajectory
following. In this re... | computer science |
36,293 | A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive
Constructions | cs.LO | The paper describes the refinement algorithm for the Calculus of
(Co)Inductive Constructions (CIC) implemented in the interactive theorem prover
Matita. The refinement algorithm is in charge of giving a meaning to the terms,
types and proof terms directly written by the user or generated by using
tactics, decision proc... | computer science |
36,294 | Interaction Histories and Short Term Memory: Enactive Development of
Turn-taking Behaviors in a Childlike Humanoid Robot | cs.AI | In this article, an enactive architecture is described that allows a humanoid
robot to learn to compose simple actions into turn-taking behaviors while
playing interaction games with a human partner. The robot's action choices are
reinforced by social feedback from the human in the form of visual attention
and measures... | computer science |
36,295 | Can Intelligence Explode? | cs.AI | The technological singularity refers to a hypothetical scenario in which
technological advances virtually explode. The most popular scenario is the
creation of super-intelligent algorithms that recursively create ever higher
intelligences. It took many decades for these ideas to spread from science
fiction to popular s... | computer science |
36,296 | Possibilistic Pertinence Feedback and Semantic Networks for Goal's
Extraction | cs.AI | Pertinence Feedback is a technique that enables a user to interactively
express his information requirement by modifying his original query formulation
with further information. This information is provided by explicitly confirming
the pertinent of some indicating objects and/or goals extracted by the system.
Obviously... | computer science |
36,297 | Loopy Belief Propagation in Bayesian Networks : origin and possibilistic
perspectives | cs.AI | In this paper we present a synthesis of the work performed on two inference
algorithms: the Pearl's belief propagation (BP) algorithm applied to Bayesian
networks without loops (i.e. polytree) and the Loopy belief propagation (LBP)
algorithm (inspired from the BP) which is applied to networks containing
undirected cycl... | computer science |
36,298 | The hardest logic puzzle ever becomes even tougher | math.LO | "The hardest logic puzzle ever" presented by George Boolos became a target
for philosophers and logicians who tried to modify it and make it even tougher.
I propose further modification of the original puzzle where part of the
available information is eliminated but the solution is still possible. The
solution also giv... | computer science |
36,299 | Adaptive Inference on General Graphical Models | cs.DS | Many algorithms and applications involve repeatedly solving variations of the
same inference problem; for example we may want to introduce new evidence to
the model or perform updates to conditional dependencies. The goal of adaptive
inference is to take advantage of what is preserved in the model and perform
inference... | computer science |
36,300 | Identifying reasoning patterns in games | cs.GT | We present an algorithm that identifies the reasoning patterns of agents in a
game, by iteratively examining the graph structure of its Multi-Agent Influence
Diagram (MAID) representation. If the decision of an agent participates in no
reasoning patterns, then we can effectively ignore that decision for the
purpose of ... | computer science |
36,301 | Complexity of Inference in Graphical Models | cs.DS | It is well-known that inference in graphical models is hard in the worst
case, but tractable for models with bounded treewidth. We ask whether treewidth
is the only structural criterion of the underlying graph that enables tractable
inference. In other words, is there some class of structures with unbounded
treewidth i... | computer science |
36,302 | Gibbs Sampling in Factorized Continuous-Time Markov Processes | cs.AI | A central task in many applications is reasoning about processes that change
over continuous time. Continuous-Time Bayesian Networks is a general compact
representation language for multi-component continuous-time processes. However,
exact inference in such processes is exponential in the number of components,
and thus... | computer science |
36,303 | Learning and Solving Many-Player Games through a Cluster-Based
Representation | cs.GT | In addressing the challenge of exponential scaling with the number of agents
we adopt a cluster-based representation to approximately solve asymmetric games
of very many players. A cluster groups together agents with a similar
"strategic view" of the game. We learn the clustered approximation from data
consisting of st... | computer science |
36,304 | Toward Experiential Utility Elicitation for Interface Customization | cs.AI | User preferences for automated assistance often vary widely, depending on the
situation, and quality or presentation of help. Developing effectivemodels to
learn individual preferences online requires domain models that associate
observations of user behavior with their utility functions, which in turn can
be construct... | computer science |
36,305 | The Evaluation of Causal Effects in Studies with an Unobserved
Exposure/Outcome Variable: Bounds and Identification | stat.ME | This paper deals with the problem of evaluating the causal effect using
observational data in the presence of an unobserved exposure/ outcome variable,
when cause-effect relationships between variables can be described as a
directed acyclic graph and the corresponding recursive factorization of a joint
distribution. Fi... | computer science |
36,306 | Discovering Cyclic Causal Models by Independent Components Analysis | cs.AI | We generalize Shimizu et al's (2006) ICA-based approach for discovering
linear non-Gaussian acyclic (LiNGAM) Structural Equation Models (SEMs) from
causally sufficient, continuous-valued observational data. By relaxing the
assumption that the generating SEM's graph is acyclic, we solve the more
general problem of linea... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.