Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
36,307 | CT-NOR: Representing and Reasoning About Events in Continuous Time | cs.AI | We present a generative model for representing and reasoning about the
relationships among events in continuous time. We apply the model to the domain
of networked and distributed computing environments where we fit the parameters
of the model from timestamp observations, and then use hypothesis testing to
discover dep... | computer science |
36,308 | A Dynamic Programming Algorithm for Inference in Recursive Probabilistic
Programs | cs.AI | We describe a dynamic programming algorithm for computing the marginal
distribution of discrete probabilistic programs. This algorithm takes a
functional interpreter for an arbitrary probabilistic programming language and
turns it into an efficient marginalizer. Because direct caching of
sub-distributions is impossible... | computer science |
36,309 | A Linear-Programming Approximation of AC Power Flows | cs.AI | Linear active-power-only DC power flow approximations are pervasive in the
planning and control of power systems. However, these approximations fail to
capture reactive power and voltage magnitudes, both of which are necessary in
many applications to ensure voltage stability and AC power flow feasibility.
This paper pr... | computer science |
36,310 | Alan Turing and the "Hard" and "Easy" Problem of Cognition: Doing and
Feeling | cs.AI | The "easy" problem of cognitive science is explaining how and why we can do
what we can do. The "hard" problem is explaining how and why we feel. Turing's
methodology for cognitive science (the Turing Test) is based on doing: Design a
model that can do anything a human can do, indistinguishably from a human, to a
human... | computer science |
36,311 | Information Retrieval in Intelligent Systems: Current Scenario & Issues | cs.IR | Web space is the huge repository of data. Everyday lots of new information
get added to this web space. The more the information, more is demand for tools
to access that information. Answering users' queries about the online
information intelligently is one of the great challenges in information
retrieval in intelligen... | computer science |
36,312 | An Improved Gauss-Newtons Method based Back-propagation Algorithm for
Fast Convergence | cs.AI | The present work deals with an improved back-propagation algorithm based on
Gauss-Newton numerical optimization method for fast convergence. The steepest
descent method is used for the back-propagation. The algorithm is tested using
various datasets and compared with the steepest descent back-propagation
algorithm. In ... | computer science |
36,313 | Latent Collaborative Retrieval | cs.IR | Retrieval tasks typically require a ranking of items given a query.
Collaborative filtering tasks, on the other hand, learn to model user's
preferences over items. In this paper we study the joint problem of
recommending items to a user with respect to a given query, which is a
surprisingly common task. This setup diff... | computer science |
36,314 | Large-Flip Importance Sampling | stat.CO | We propose a new Monte Carlo algorithm for complex discrete distributions.
The algorithm is motivated by the N-Fold Way, which is an ingenious
event-driven MCMC sampler that avoids rejection moves at any specific state.
The N-Fold Way can however get "trapped" in cycles. We surmount this problem by
modifying the sampli... | computer science |
36,315 | Causal Reasoning in Graphical Time Series Models | stat.ME | We propose a definition of causality for time series in terms of the effect
of an intervention in one component of a multivariate time series on another
component at some later point in time. Conditions for identifiability,
comparable to the back-door and front-door criteria, are presented and can also
be verified grap... | computer science |
36,316 | Probabilistic Models for Anomaly Detection in Remote Sensor Data Streams | cs.AI | Remote sensors are becoming the standard for observing and recording
ecological data in the field. Such sensors can record data at fine temporal
resolutions, and they can operate under extreme conditions prohibitive to human
access. Unfortunately, sensor data streams exhibit many kinds of errors ranging
from corrupt co... | computer science |
36,317 | Reachability Under Uncertainty | cs.DS | In this paper we introduce a new network reachability problem where the goal
is to find the most reliable path between two nodes in a network, represented
as a directed acyclic graph. Individual edges within this network may fail
according to certain probabilities, and these failure probabilities may depend
on the valu... | computer science |
36,318 | Evaluation of the Causal Effect of Control Plans in Nonrecursive
Structural Equation Models | stat.ME | When observational data is available from practical studies and a directed
cyclic graph for how various variables affect each other is known based on
substantive understanding of the process, we consider a problem in which a
control plan of a treatment variable is conducted in order to bring a response
variable close t... | computer science |
36,319 | Polynomial Constraints in Causal Bayesian Networks | cs.AI | We use the implicitization procedure to generate polynomial equality
constraints on the set of distributions induced by local interventions on
variables governed by a causal Bayesian network with hidden variables. We show
how we may reduce the complexity of the implicitization problem and make the
problem tractable in ... | computer science |
36,320 | Making life better one large system at a time: Challenges for UAI
research | cs.SE | The rapid growth and diversity in service offerings and the ensuing
complexity of information technology ecosystems present numerous management
challenges (both operational and strategic). Instrumentation and measurement
technology is, by and large, keeping pace with this development and growth.
However, the algorithms... | computer science |
36,321 | Ranking Under Uncertainty | cs.AI | Ranking objects is a simple and natural procedure for organizing data. It is
often performed by assigning a quality score to each object according to its
relevance to the problem at hand. Ranking is widely used for object selection,
when resources are limited and it is necessary to select a subset of most
relevant obje... | computer science |
36,322 | Importance Sampling via Variational Optimization | stat.CO | Computing the exact likelihood of data in large Bayesian networks consisting
of thousands of vertices is often a difficult task. When these models contain
many deterministic conditional probability tables and when the observed values
are extremely unlikely even alternative algorithms such as variational methods
and sto... | computer science |
36,323 | Constrained Automated Mechanism Design for Infinite Games of Incomplete
Information | cs.GT | We present a functional framework for automated mechanism design based on a
two-stage game model of strategic interaction between the designer and the
mechanism participants, and apply it to several classes of two-player infinite
games of incomplete information. At the core of our framework is a black-box
optimization ... | computer science |
36,324 | A Criterion for Parameter Identification in Structural Equation Models | stat.ME | This paper deals with the problem of identifying direct causal effects in
recursive linear structural equation models. The paper establishes a sufficient
criterion for identifying individual causal effects and provides a procedure
computing identified causal effects in terms of observed covariance matrix. | computer science |
36,325 | Predicting the behavior of interacting humans by fusing data from
multiple sources | cs.AI | Multi-fidelity methods combine inexpensive low-fidelity simulations with
costly but high-fidelity simulations to produce an accurate model of a system
of interest at minimal cost. They have proven useful in modeling physical
systems and have been applied to engineering problems such as wing-design
optimization. During ... | computer science |
36,326 | The observational roots of reference of the semantic web | cs.AI | Shared reference is an essential aspect of meaning. It is also indispensable
for the semantic web, since it enables to weave the global graph, i.e., it
allows different users to contribute to an identical referent. For example, an
essential kind of referent is a geographic place, to which users may contribute
observati... | computer science |
36,327 | Extension of Three-Variable Counterfactual Casual Graphic Model: from
Two-Value to Three-Value Random Variable | stat.ME | The extension of counterfactual causal graphic model with three variables of
vertex set in directed acyclic graph (DAG) is discussed in this paper by
extending two- value distribution to three-value distribution of the variables
involved in DAG. Using the conditional independence as ancillary information, 6
kinds of ex... | computer science |
36,328 | Sensitivity Analysis for Threshold Decision Making with Dynamic Networks | cs.AI | The effect of inaccuracies in the parameters of a dynamic Bayesian network
can be investigated by subjecting the network to a sensitivity analysis. Having
detailed the resulting sensitivity functions in our previous work, we now study
the effect of parameter inaccuracies on a recommended decision in view of a
threshold... | computer science |
36,329 | Optimal Coordinated Planning Amongst Self-Interested Agents with Private
State | cs.GT | Consider a multi-agent system in a dynamic and uncertain environment. Each
agent's local decision problem is modeled as a Markov decision process (MDP)
and agents must coordinate on a joint action in each period, which provides a
reward to each agent and causes local state transitions. A social planner knows
the model ... | computer science |
36,330 | Graphical Condition for Identification in recursive SEM | cs.AI | The paper concerns the problem of predicting the effect of actions or
interventions on a system from a combination of (i) statistical data on a set
of observed variables, and (ii) qualitative causal knowledge encoded in the
form of a directed acyclic graph (DAG). The DAG represents a set of linear
equations called Stru... | computer science |
36,331 | Non-Minimal Triangulations for Mixed Stochastic/Deterministic Graphical
Models | cs.AI | We observe that certain large-clique graph triangulations can be useful to
reduce both computational and space requirements when making queries on mixed
stochastic/deterministic graphical models. We demonstrate that many of these
large-clique triangulations are non-minimal and are thus unattainable via the
variable eli... | computer science |
36,332 | Inequality Constraints in Causal Models with Hidden Variables | cs.AI | We present a class of inequality constraints on the set of distributions
induced by local interventions on variables governed by a causal Bayesian
network, in which some of the variables remain unmeasured. We derive bounds on
causal effects that are not directly measured in randomized experiments. We
derive instrumenta... | computer science |
36,333 | Adjacency-Faithfulness and Conservative Causal Inference | cs.AI | Most causal inference algorithms in the literature (e.g., Pearl (2000),
Spirtes et al. (2000), Heckerman et al. (1999)) exploit an assumption usually
referred to as the causal Faithfulness or Stability condition. In this paper,
we highlight two components of the condition used in constraint-based
algorithms, which we c... | computer science |
36,334 | A theoretical study of Y structures for causal discovery | cs.AI | There are several existing algorithms that under appropriate assumptions can
reliably identify a subset of the underlying causal relationships from
observational data. This paper introduces the first computationally feasible
score-based algorithm that can reliably identify causal relationships in the
large sample limit... | computer science |
36,335 | Stratified Analysis of `Probabilities of Causation' | stat.ME | This paper proposes new formulas for the probabilities of causation difined
by Pearl (2000). Tian and Pearl (2000a, 2000b) showed how to bound the
quantities of the probabilities of causation from experimental and
observational data, under the minimal assumptions about the data-generating
process. We derive narrower bo... | computer science |
36,336 | Axiomatic Foundations for a Class of Generalized Expected Utility:
Algebraic Expected Utility | cs.AI | Expected Utility: Algebraic Expected Utility In this paper, we provide two
axiomatizations of algebraic expected utility, which is a particular
generalized expected utility, in a von Neumann-Morgenstern setting, i.e.
uncertainty representation is supposed to be given and here to be described by
a plausibility measure v... | computer science |
36,337 | Bayesian Inference for Gaussian Mixed Graph Models | stat.ME | We introduce priors and algorithms to perform Bayesian inference in Gaussian
models defined by acyclic directed mixed graphs. Such a class of graphs,
composed of directed and bi-directed edges, is a representation of conditional
independencies that is closed under marginalization and arises naturally from
causal models... | computer science |
36,338 | Identification of Conditional Interventional Distributions | cs.AI | The subject of this paper is the elucidation of effects of actions from
causal assumptions represented as a directed graph, and statistical knowledge
given as a probability distribution. In particular, we are interested in
predicting conditional distributions resulting from performing an action on a
set of variables an... | computer science |
36,339 | Inference in Hybrid Bayesian Networks Using Mixtures of Gaussians | cs.AI | The main goal of this paper is to describe a method for exact inference in
general hybrid Bayesian networks (BNs) (with a mixture of discrete and
continuous chance variables). Our method consists of approximating general
hybrid Bayesian networks by a mixture of Gaussians (MoG) BNs. There exists a
fast algorithm by Laur... | computer science |
36,340 | Computing Strong and Weak Permissions in Defeasible Logic | cs.LO | In this paper we propose an extension of Defeasible Logic to represent and
compute three concepts of defeasible permission. In particular, we discuss
different types of explicit permissive norms that work as exceptions to
opposite obligations. Moreover, we show how strong permissions can be
represented both with, and w... | computer science |
36,341 | Compositional Stochastic Modeling and Probabilistic Programming | cs.AI | Probabilistic programming is related to a compositional approach to
stochastic modeling by switching from discrete to continuous time dynamics. In
continuous time, an operator-algebra semantics is available in which processes
proceeding in parallel (and possibly interacting) have summed time-evolution
operators. From t... | computer science |
36,342 | A simple method for decision making in robocup soccer simulation 3d
environment | cs.AI | In this paper new hierarchical hybrid fuzzy-crisp methods for decision making
and action selection of an agent in soccer simulation 3D environment are
presented. First, the skills of an agent are introduced, implemented and
classified in two layers, the basicskills and the highlevel skills. In the
second layer, a twoph... | computer science |
36,343 | Testing the AgreementMaker System in the Anatomy Task of OAEI 2012 | cs.IR | The AgreementMaker system was the leading system in the anatomy task of the
Ontology Alignment Evaluation Initiative (OAEI) competition in 2011. While
AgreementMaker did not compete in OAEI 2012, here we report on its performance
in the 2012 anatomy task, using the same configurations of AgreementMaker
submitted to OAE... | computer science |
36,344 | IK-PSO, PSO Inverse Kinematics Solver with Application to Biped Gait
Generation | cs.RO | This paper describes a new approach allowing the generation of a simplified
Biped gait. This approach combines a classical dynamic modeling with an inverse
kinematics' solver based on particle swarm optimization, PSO. First, an
inverted pendulum, IP, is used to obtain a simplified dynamic model of the
robot and to comp... | computer science |
36,345 | The Dynamic Controllability of Conditional STNs with Uncertainty | cs.AI | Recent attempts to automate business processes and medical-treatment
processes have uncovered the need for a formal framework that can accommodate
not only temporal constraints, but also observations and actions with
uncontrollable durations. To meet this need, this paper defines a Conditional
Simple Temporal Network w... | computer science |
36,346 | Tree Projections and Structural Decomposition Methods: Minimality and
Game-Theoretic Characterization | cs.DM | Tree projections provide a mathematical framework that encompasses all the
various (purely) structural decomposition methods that have been proposed in
the literature to single out classes of nearly-acyclic (hyper)graphs, such as
the tree decomposition method, which is the most powerful decomposition method
on graphs, ... | computer science |
36,347 | Inference in Polytrees with Sets of Probabilities | cs.AI | Inferences in directed acyclic graphs associated with probability sets and
probability intervals are NP-hard, even for polytrees. In this paper we focus
on such inferences, and propose: 1) a substantial improvement on Tessems A / R
algorithm FOR polytrees WITH probability intervals; 2) a new algorithm FOR
direction - b... | computer science |
36,348 | Loopy Belief Propagation as a Basis for Communication in Sensor Networks | cs.AI | Sensor networks are an exciting new kind of computer system. Consisting of a
large number of tiny, cheap computational devices physically distributed in an
environment, they gather and process data about the environment in real time.
One of the central questions in sensor networks is what to do with the data,
i.e., how... | computer science |
36,349 | A Linear Belief Function Approach to Portfolio Evaluation | cs.AI | By elaborating on the notion of linear belief functions (Dempster 1990; Liu
1996), we propose an elementary approach to knowledge representation for expert
systems using linear belief functions. We show how to use basic matrices to
represent market information and financial knowledge, including complete
ignorance, stat... | computer science |
36,350 | Phase Transition of Tractability in Constraint Satisfaction and Bayesian
Network Inference | cs.AI | There has been great interest in identifying tractable subclasses of NP
complete problems and designing efficient algorithms for these tractable
classes. Constraint satisfaction and Bayesian network inference are two
examples of such problems that are of great importance in AI and algorithms. In
this paper we study, un... | computer science |
36,351 | Decentralized Sensor Fusion With Distributed Particle Filters | cs.AI | This paper presents a scalable Bayesian technique for decentralized state
estimation from multiple platforms in dynamic environments. As has long been
recognized, centralized architectures impose severe scaling limitations for
distributed systems due to the enormous communication overheads. We propose a
strictly decent... | computer science |
36,352 | Marginalizing Out Future Passengers in Group Elevator Control | cs.AI | Group elevator scheduling is an NP-hard sequential decision-making problem
with unbounded state spaces and substantial uncertainty. Decision-theoretic
reasoning plays a surprisingly limited role in fielded systems. A new
opportunity for probabilistic methods has opened with the recent discovery of a
tractable solution ... | computer science |
36,353 | Strong Faithfulness and Uniform Consistency in Causal Inference | cs.AI | A fundamental question in causal inference is whether it is possible to
reliably infer manipulation effects from observational data. There are a
variety of senses of asymptotic reliability in the statistical literature,
among which the most commonly discussed frequentist notions are pointwise
consistency and uniform co... | computer science |
36,354 | Exploiting Locality in Searching the Web | cs.IR | Published experiments on spidering the Web suggest that, given training data
in the form of a (relatively small) subgraph of the Web containing a subset of
a selected class of target pages, it is possible to conduct a directed search
and find additional target pages significantly faster (with fewer page
retrievals) tha... | computer science |
36,355 | The Revisiting Problem in Mobile Robot Map Building: A Hierarchical
Bayesian Approach | cs.AI | We present an application of hierarchical Bayesian estimation to robot map
building. The revisiting problem occurs when a robot has to decide whether it
is seeing a previously-built portion of a map, or is exploring new territory.
This is a difficult decision problem, requiring the probability of being
outside of the c... | computer science |
36,356 | Understanding (dis)similarity measures | cs.AI | Intuitively, the concept of similarity is the notion to measure an inexact
matching between two entities of the same reference set. The notions of
similarity and its close relative dissimilarity are widely used in many fields
of Artificial Intelligence. Yet they have many different and often partial
definitions or prop... | computer science |
36,357 | Product/Brand extraction from WikiPedia | cs.IR | In this paper we describe the task of extracting product and brand pages from
wikipedia. We present an experimental environment and setup built on top of a
dataset of wikipedia pages we collected. We introduce a method for recognition
of product pages modelled as a boolean probabilistic classification task. We
show tha... | computer science |
36,358 | Probability Bracket Notation: Markov State Chain Projector, Hidden
Markov Models and Dynamic Bayesian Networks | cs.AI | After a brief discussion of Markov Evolution Formula (MEF) expressed in
Probability Bracket Notation (PBN), its close relation with the joint
probability distribution (JPD) of Visible Markov Models (VMM) is demonstrated
by introducing Markov State Chain Projector (MSCP). The state basis and the
observed basis are defin... | computer science |
36,359 | Increasing Air Traffic: What is the Problem? | cs.AI | Nowadays, huge efforts are made to modernize the air traffic management
systems to cope with uncertainty, complexity and sub-optimality. An answer is
to enhance the information sharing between the stakeholders. This paper
introduces a framework that bridges the gap between air traffic management and
air traffic control... | computer science |
36,360 | Online Learning for Ground Trajectory Prediction | cs.AI | This paper presents a model based on an hybrid system to numerically simulate
the climbing phase of an aircraft. This model is then used within a trajectory
prediction tool. Finally, the Covariance Matrix Adaptation Evolution Strategy
(CMA-ES) optimization algorithm is used to tune five selected parameters, and
thus im... | computer science |
36,361 | Prediction of Parallel Speed-ups for Las Vegas Algorithms | cs.DC | We propose a probabilistic model for the parallel execution of Las Vegas
algorithms, i.e., randomized algorithms whose runtime might vary from one
execution to another, even with the same input. This model aims at predicting
the parallel performances (i.e., speedups) by analysis the runtime distribution
of the sequenti... | computer science |
36,362 | A trust-based security mechanism for nomadic users in pervasive systems | cs.CR | The emergence of network technologies and the appearance of new varied
applications in terms of services and resources, has created new security
problems for which existing solutions and mechanisms are inadequate, especially
problems of identification and authentication. In a highly distributed and
pervasive system, a ... | computer science |
36,363 | Interactive Ant Colony Optimisation (iACO) for Early Lifecycle Software
Design | cs.SE | Software design is crucial to successful software development, yet is a
demanding multi-objective problem for software engineers. In an attempt to
assist the software designer, interactive (i.e. human in-the-loop)
meta-heuristic search techniques such as evolutionary computing have been
applied and show promising resul... | computer science |
36,364 | Generating Motion Patterns Using Evolutionary Computation in Digital
Soccer | cs.AI | Dribbling an opponent player in digital soccer environment is an important
practical problem in motion planning. It has special complexities which can be
generalized to most important problems in other similar Multi Agent Systems. In
this paper, we propose a hybrid computational geometry and evolutionary
computation ap... | computer science |
36,365 | Design of Intelligent Agents Based System for Commodity Market
Simulation with JADE | cs.MA | A market of potato commodity for industry scale usage is engaging several
types of actors. They are farmers, middlemen, and industries. A multi-agent
system has been built to simulate these actors into agent entities, based on
manually given parameters within a simulation scenario file. Each type of
agents has its own ... | computer science |
36,366 | Dialectics of Knowledge Representation in a Granular Rough Set Theory | cs.AI | The concepts of rough and definite objects are relatively more determinate
than those of granules and granulation in general rough set theory (RST) [1].
Representation of rough objects can however depend on the dialectical relation
between granulation and definiteness. In this research, we make this exact in
the contex... | computer science |
36,367 | Proceedings of the 12th International Colloquium on Implementation of
Constraint and LOgic Programming Systems | cs.PL | This volume contains the papers presented at CICLOPS'12: 12th International
Colloquium on Implementation of Constraint and LOgic Programming Systems held
on Tueseday September 4th, 2012 in Budapest.
The program included 1 invited talk, 9 technical presentations and a panel
discussion on Prolog open standards (open.pl... | computer science |
36,368 | Efficient Induction of Finite State Automata | cs.AI | This paper introduces a new algorithm for the induction if complex finite
state automata from samples of behavior. The algorithm is based on information
theoretic principles. The algorithm reduces the search space by many orders of
magnitude over what was previously thought possible. We compare the algorithm
with some ... | computer science |
36,369 | Problem-Focused Incremental Elicitation of Multi-Attribute Utility
Models | cs.AI | Decision theory has become widely accepted in the AI community as a useful
framework for planning and decision making. Applying the framework typically
requires elicitation of some form of probability and utility information. While
much work in AI has focused on providing representations and tools for
elicitation of pr... | computer science |
36,370 | Perception, Attention, and Resources: A Decision-Theoretic Approach to
Graphics Rendering | cs.AI | We describe work to control graphics rendering under limited computational
resources by taking a decision-theoretic perspective on perceptual costs and
computational savings of approximations. The work extends earlier work on the
control of rendering by introducing methods and models for computing the
expected cost ass... | computer science |
36,371 | Incremental Map Generation by Low Cost Robots Based on
Possibility/Necessity Grids | cs.RO | In this paper we present some results obtained with a troupe of low-cost
robots designed to cooperatively explore and adquire the map of unknown
structured orthogonal environments. In order to improve the covering of the
explored zone, the robots show different behaviours and cooperate by
transferring each other the pe... | computer science |
36,372 | Conditional Utility, Utility Independence, and Utility Networks | cs.GT | We introduce a new interpretation of two related notions - conditional
utility and utility independence. Unlike the traditional interpretation, the
new interpretation renders the notions the direct analogues of their
probabilistic counterparts. To capture these notions formally, we appeal to the
notion of utility distr... | computer science |
36,373 | Score and Information for Recursive Exponential Models with Incomplete
Data | stat.ME | Recursive graphical models usually underlie the statistical modelling
concerning probabilistic expert systems based on Bayesian networks. This paper
defines a version of these models, denoted as recursive exponential models,
which have evolved by the desire to impose sophisticated domain knowledge onto
local fragments ... | computer science |
36,374 | A Sufficiently Fast Algorithm for Finding Close to Optimal Junction
Trees | cs.DS | An algorithm is developed for finding a close to optimal junction tree of a
given graph G. The algorithm has a worst case complexity O(c^k n^a) where a and
c are constants, n is the number of vertices, and k is the size of the largest
clique in a junction tree of G in which this size is minimized. The algorithm
guarant... | computer science |
36,375 | Tail Sensitivity Analysis in Bayesian Networks | cs.AI | The paper presents an efficient method for simulating the tails of a target
variable Z=h(X) which depends on a set of basic variables X=(X_1, ..., X_n). To
this aim, variables X_i, i=1, ..., n are sequentially simulated in such a
manner that Z=h(x_1, ..., x_i-1, X_i, ..., X_n) is guaranteed to be in the tail
of Z. When... | computer science |
36,376 | Decision-Analytic Approaches to Operational Decision Making: Application
and Observation | cs.AI | Decision analysis (DA) and the rich set of tools developed by researchers in
decision making under uncertainty show great potential to penetrate the
technological content of the products and services delivered by firms in a
variety of industries as well as the business processes used to deliver those
products and servi... | computer science |
36,377 | Toward a Market Model for Bayesian Inference | cs.GT | We present a methodology for representing probabilistic relationships in a
general-equilibrium economic model. Specifically, we define a precise mapping
from a Bayesian network with binary nodes to a market price system where
consumers and producers trade in uncertain propositions. We demonstrate the
correspondence bet... | computer science |
36,378 | A solution concept for games with altruism and cooperation | cs.GT | Over the years, numerous experiments have been accumulated to show that
cooperation is not casual and depends on the payoffs of the game. These
findings suggest that humans have attitude to cooperation by nature and the
same person may act more or less cooperatively depending on the particular
payoffs. In other words, ... | computer science |
36,379 | Towards a theory of good SAT representations | cs.AI | We aim at providing a foundation of a theory of "good" SAT representations F
of boolean functions f. We argue that the hierarchy UC_k of unit-refutation
complete clause-sets of level k, introduced by the authors, provides the most
basic target classes, that is, F in UC_k is to be achieved for k as small as
feasible. If... | computer science |
36,380 | In Love With a Robot: the Dawn of Machine-To-Machine Marketing | cs.AI | The article looks at mass market artificial intelligence tools in the context
of their ever-growing sophistication, availability and market penetration. The
subject is especially relevant today for these exact reasons - if a few years
ago AI was the subject of high tech research and science fiction novels, today,
we in... | computer science |
36,381 | Exploiting Social Tags for Cross-Domain Collaborative Filtering | cs.IR | One of the most challenging problems in recommender systems based on the
collaborative filtering (CF) concept is data sparseness, i.e., limited user
preference data is available for making recommendations. Cross-domain
collaborative filtering (CDCF) has been studied as an effective mechanism to
alleviate data sparsenes... | computer science |
36,382 | An Algebraic Semantics for Possibilistic Logic | cs.AI | The first contribution of this paper is the presentation of a Pavelka - like
formulation of possibilistic logic in which the language is naturally enriched
by two connectives which represent negation (eg) and a new type of conjunction
(otimes). The space of truth values for this logic is the lattice of
possibility func... | computer science |
36,383 | Development Of Ontology-Based Intelligent System For Software Testing | cs.AI | Software testing is a prime factor in software industry. Besides knowing the
importance of testing, only limited time is allocated for teaching it. It will
be more efficient if testing is taught simultaneously with programming
foundations. This integrated learning of testing techniques and programming
allows the progra... | computer science |
36,384 | Weighted Sets of Probabilities and Minimax Weighted Expected Regret: New
Approaches for Representing Uncertainty and Making Decisions | cs.GT | We consider a setting where an agent's uncertainty is represented by a set of
probability measures, rather than a single measure. Measure-by-measure updating
of such a set of measures upon acquiring new information is well-known to
suffer from problems; agents are not always able to learn appropriately. To
deal with th... | computer science |
36,385 | Combining Multiple Time Series Models Through A Robust Weighted
Mechanism | cs.AI | Improvement of time series forecasting accuracy through combining multiple
models is an important as well as a dynamic area of research. As a result,
various forecasts combination methods have been developed in literature.
However, most of them are based on simple linear ensemble strategies and hence
ignore the possibl... | computer science |
36,386 | Using Modified Partitioning Around Medoids Clustering Technique in
Mobile Network Planning | cs.AI | Every cellular network deployment requires planning and optimization in order
to provide adequate coverage, capacity, and quality of service (QoS).
Optimization mobile radio network planning is a very complex task, as many
aspects must be taken into account. With the rapid development in mobile
network we need effectiv... | computer science |
36,387 | Approximation Algorithms for the Loop Cutset Problem | cs.AI | We show how to find a small loop curser in a Bayesian network. Finding such a
loop cutset is the first step in the method of conditioning for inference. Our
algorithm for finding a loop cutset, called MGA, finds a loop cutset which is
guaranteed in the worst case to contain less than twice the number of variables
conta... | computer science |
36,388 | On Modal Logics for Qualitative Possibility in a Fuzzy Setting | cs.LO | Within the possibilistic approach to uncertainty modeling, the paper presents
a modal logical system to reason about qualitative (comparative) statements of
the possibility (and necessity) of fuzzy propositions. We relate this
qualitative modal logic to the many--valued analogues MVS5 and MVKD45 of the
well known modal... | computer science |
36,389 | Three Approaches to Probability Model Selection | stat.ME | This paper compares three approaches to the problem of selecting among
probability models to fit data (1) use of statistical criteria such as Akaike's
information criterion and Schwarz's "Bayesian information criterion," (2)
maximization of the posterior probability of the model, and (3) maximization of
an effectivenes... | computer science |
36,390 | Modeling Stable Matching Problems with Answer Set Programming | cs.AI | The Stable Marriage Problem (SMP) is a well-known matching problem first
introduced and solved by Gale and Shapley (1962). Several variants and
extensions to this problem have since been investigated to cover a wider set of
applications. Each time a new variant is considered, however, a new algorithm
needs to be develo... | computer science |
36,391 | A Community Based Algorithm for Large Scale Web Service Composition | cs.AI | Web service composition is the process of synthesizing a new composite
service using a set of available Web services in order to satisfy a client
request that cannot be treated by any available Web services. The Web services
space is a dynamic environment characterized by a huge number of elements.
Furthermore, many We... | computer science |
36,392 | Projective simulation for classical learning agents: a comprehensive
investigation | nlin.AO | We study the model of projective simulation (PS), a novel approach to
artificial intelligence based on stochastic processing of episodic memory which
was recently introduced [H.J. Briegel and G. De las Cuevas. Sci. Rep. 2, 400,
(2012)]. Here we provide a detailed analysis of the model and examine its
performance, inclu... | computer science |
36,393 | Unsatisfiable Cores for Constraint Programming | cs.LO | Constraint Programming (CP) solvers typically tackle optimization problems by
repeatedly finding solutions to a problem while placing tighter and tighter
bounds on the solution cost. This approach is somewhat naive, especially for
soft-constraint optimization problems in which the soft constraints are mostly
satisfied.... | computer science |
36,394 | Semantic-based Anomalous Pattern Discovery in Moving Object Trajectories | cs.AI | In this work, we investigate a novel semantic approach for pattern discovery
in trajectories that, relying on ontologies, enhances object movement
information with event semantics. The approach can be applied to the detection
of movement patterns and behaviors whenever the semantics of events occurring
along the trajec... | computer science |
36,395 | Hybrid fuzzy logic and pid controller based ph neutralization pilot
plant | cs.SY | Use of Control theory within process control industries has changed rapidly
due to the increase complexity of instrumentation, real time requirements,
minimization of operating costs and highly nonlinear characteristics of
chemical process. Previously developed process control technologies which are
mostly based on a s... | computer science |
36,396 | Belief Propagation for Linear Programming | cs.AI | Belief Propagation (BP) is a popular, distributed heuristic for performing
MAP computations in Graphical Models. BP can be interpreted, from a variational
perspective, as minimizing the Bethe Free Energy (BFE). BP can also be used to
solve a special class of Linear Programming (LP) problems. For this class of
problems,... | computer science |
36,397 | The state-of-the-art in web-scale semantic information processing for
cloud computing | cs.DC | Based on integrated infrastructure of resource sharing and computing in
distributed environment, cloud computing involves the provision of dynamically
scalable and provides virtualized resources as services over the Internet.
These applications also bring a large scale heterogeneous and distributed
information which po... | computer science |
36,398 | Note on Evaluation of Hierarchical Modular Systems | cs.AI | This survey note describes a brief systemic view to approaches for evaluation
of hierarchical composite (modular) systems. The list of considered issues
involves the following: (i) basic assessment scales (quantitative scale,
ordinal scale, multicriteria description, two kinds of poset-like scales), (ii)
basic types of... | computer science |
36,399 | An Intelligent System to Detect, Avoid and Maintain Potholes: A Graph
Theoretic Approach | cs.AI | In this paper, we propose a conceptual framework where a centralized system,
classifies the road based upon the level of damage. The centralized system also
identifies the traffic intensity thereby prioritizing the roads that need quick
action to be taken upon. Moreover, the system helps the driver to detect the
level ... | computer science |
36,400 | Semantic Web Search based on Ontology Modeling using Protege Reasoner | cs.IR | The Semantic Web works on the existing Web which presents the meaning of
information as well-defined vocabularies understood by the people. Semantic
Search, at the same time, works on improving the accuracy if a search by
understanding the intent of the search and providing contextually relevant
results. This paper des... | computer science |
36,401 | Semi-bounded Rationality: A model for decision making | cs.AI | In this paper the theory of semi-bounded rationality is proposed as an
extension of the theory of bounded rationality. In particular, it is proposed
that a decision making process involves two components and these are the
correlation machine, which estimates missing values, and the causal machine,
which relates the cau... | computer science |
36,402 | Modelling and Analysing Cargo Screening Processes: A Project Outline | cs.AI | The efficiency of current cargo screening processes at sea and air ports is
unknown as no benchmarks exists against which they could be measured. Some
manufacturer benchmarks exist for individual sensors but we have not found any
benchmarks that take a holistic view of the screening procedures assessing a
combination o... | computer science |
36,403 | For a Semantic Web based Peer-reviewing and Publication of Research
Results | cs.DL | This article shows why the diffusion and peer-reviewing of research results
would be more efficient, precise and relevant if all or at least some parts of
the descriptions and peer-reviews of research results took the form of a
fine-grained semantic network, within articles or knowledge bases, as part of
the Semantic W... | computer science |
36,404 | Modelling Electricity Consumption in Office Buildings: An Agent Based
Approach | cs.CE | In this paper, we develop an agent-based model which integrates four
important elements, i.e. organisational energy management policies/regulations,
energy management technologies, electric appliances and equipment, and human
behaviour, to simulate the electricity consumption in office buildings. Based
on a case study,... | computer science |
36,405 | Investigating Mathematical Models of Immuno-Interactions with
Early-Stage Cancer under an Agent-Based Modelling Perspective | cs.CE | Many advances in research regarding immuno-interactions with cancer were
developed with the help of ordinary differential equation (ODE) models. These
models, however, are not effectively capable of representing problems involving
individual localisation, memory and emerging properties, which are common
characteristics... | computer science |
36,406 | Decision Making under Uncertainty: A Quasimetric Approach | cs.AI | We propose a new approach for solving a class of discrete decision making
problems under uncertainty with positive cost. This issue concerns multiple and
diverse fields such as engineering, economics, artificial intelligence,
cognitive science and many others. Basically, an agent has to choose a single
or series of act... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.