Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
35,906 | Towards Multistage Design of Modular Systems | cs.AI | The paper describes multistage design of composite (modular) systems (i.e.,
design of a system trajectory). This design process consists of the following:
(i) definition of a set of time/logical points; (ii) modular design of the
system for each time/logical point (e.g., on the basis of combinatorial
synthesis as hiera... | computer science |
35,907 | Penetration Testing == POMDP Solving? | cs.AI | Penetration Testing is a methodology for assessing network security, by
generating and executing possible attacks. Doing so automatically allows for
regular and systematic testing without a prohibitive amount of human labor. A
key question then is how to generate the attacks. This is naturally formulated
as a planning ... | computer science |
35,908 | A Multi-Engine Approach to Answer Set Programming | cs.AI | Answer Set Programming (ASP) is a truly-declarative programming paradigm
proposed in the area of non-monotonic reasoning and logic programming, that has
been recently employed in many applications. The development of efficient ASP
systems is, thus, crucial. Having in mind the task of improving the solving
methods for A... | computer science |
35,909 | Safeguarding E-Commerce against Advisor Cheating Behaviors: Towards More
Robust Trust Models for Handling Unfair Ratings | cs.SI | In electronic marketplaces, after each transaction buyers will rate the
products provided by the sellers. To decide the most trustworthy sellers to
transact with, buyers rely on trust models to leverage these ratings to
evaluate the reputation of sellers. Although the high effectiveness of
different trust models for ha... | computer science |
35,910 | Breaking Symmetry with Different Orderings | cs.AI | We can break symmetry by eliminating solutions within each symmetry class.
For instance, the Lex-Leader method eliminates all but the smallest solution in
the lexicographical ordering. Unfortunately, the Lex-Leader method is
intractable in general. We prove that, under modest assumptions, we cannot
reduce the worst cas... | computer science |
35,912 | Affect Control Processes: Intelligent Affective Interaction using a
Partially Observable Markov Decision Process | cs.HC | This paper describes a novel method for building affectively intelligent
human-interactive agents. The method is based on a key sociological insight
that has been developed and extensively verified over the last twenty years,
but has yet to make an impact in artificial intelligence. The insight is that
resource bounded... | computer science |
35,913 | Distributed Heuristic Forward Search for Multi-Agent Systems | cs.AI | This paper describes a number of distributed forward search algorithms for
solving multi-agent planning problems. We introduce a distributed formulation
of non-optimal forward search, as well as an optimal version, MAD-A*. Our
algorithms exploit the structure of multi-agent problems to not only distribute
the work effi... | computer science |
35,914 | Activity Modeling in Smart Home using High Utility Pattern Mining over
Data Streams | cs.AI | Smart home technology is a better choice for the people to care about
security, comfort and power saving as well. It is required to develop
technologies that recognize the Activities of Daily Living (ADLs) of the
residents at home and detect the abnormal behavior in the individual's
patterns. Data mining techniques suc... | computer science |
35,915 | Measurements of collective machine intelligence | cs.AI | Independent from the still ongoing research in measuring individual
intelligence, we anticipate and provide a framework for measuring collective
intelligence. Collective intelligence refers to the idea that several
individuals can collaborate in order to achieve high levels of intelligence. We
present thus some ideas o... | computer science |
35,916 | A Heuristic Routing Mechanism Using a New Addressing Scheme | cs.NI | Current methods of routing are based on network information in the form of
routing tables, in which routing protocols determine how to update the tables
according to the network changes. Despite the variability of data in routing
tables, node addresses are constant. In this paper, we first introduce the new
concept of ... | computer science |
35,917 | Geometric Analogue of Holographic Reduced Representation | cs.AI | Holographic reduced representations (HRR) are based on superpositions of
convolution-bound $n$-tuples, but the $n$-tuples cannot be regarded as vectors
since the formalism is basis dependent. This is why HRR cannot be associated
with geometric structures. Replacing convolutions by geometric products one
arrives at redu... | computer science |
35,918 | Visualization Optimization : Application to the RoboCup Rescue Domain | cs.GR | In this paper we demonstrate the use of intelligent optimization
methodologies on the visualization optimization of virtual / simulated
environments. The problem of automatic selection of an optimized set of views,
which better describes an on-going simulation over a virtual environment is
addressed in the context of t... | computer science |
35,919 | On combinations of local theory extensions | cs.LO | In this paper we study possibilities of efficient reasoning in combinations
of theories over possibly non-disjoint signatures. We first present a class of
theory extensions (called local extensions) in which hierarchical reasoning is
possible, and give several examples from computer science and mathematics in
which suc... | computer science |
35,920 | A comparison of the notions of optimality in soft constraints and
graphical games | cs.AI | The notion of optimality naturally arises in many areas of applied
mathematics and computer science concerned with decision making. Here we
consider this notion in the context of two formalisms used for different
purposes and in different research areas: graphical games and soft constraints.
We relate the notion of opt... | computer science |
35,921 | Combining Semantic Wikis and Controlled Natural Language | cs.HC | We demonstrate AceWiki that is a semantic wiki using the controlled natural
language Attempto Controlled English (ACE). The goal is to enable easy creation
and modification of ontologies through the web. Texts in ACE can automatically
be translated into first-order logic and other languages, for example OWL.
Previous e... | computer science |
35,922 | Social Learning Methods in Board Games | cs.AI | This paper discusses the effects of social learning in training of game
playing agents. The training of agents in a social context instead of a
self-play environment is investigated. Agents that use the reinforcement
learning algorithms are trained in social settings. This mimics the way in
which players of board games... | computer science |
35,923 | On Granular Knowledge Structures | cs.AI | Knowledge plays a central role in human and artificial intelligence. One of
the key characteristics of knowledge is its structured organization. Knowledge
can be and should be presented in multiple levels and multiple views to meet
people's needs in different levels of granularities and from different
perspectives. In ... | computer science |
35,924 | On the Conditional Independence Implication Problem: A Lattice-Theoretic
Approach | cs.AI | A lattice-theoretic framework is introduced that permits the study of the
conditional independence (CI) implication problem relative to the class of
discrete probability measures. Semi-lattices are associated with CI statements
and a finite, sound and complete inference system relative to semi-lattice
inclusions is pre... | computer science |
35,925 | On the Internal Topological Structure of Plane Regions | cs.AI | The study of topological information of spatial objects has for a long time
been a focus of research in disciplines like computational geometry, spatial
reasoning, cognitive science, and robotics. While the majority of these
researches emphasised the topological relations between spatial objects, this
work studies the ... | computer science |
35,926 | A theory of intelligence: networked problem solving in animal societies | cs.AI | A society's single emergent, increasing intelligence arises partly from the
thermodynamic advantages of networking the innate intelligence of different
individuals, and partly from the accumulation of solved problems. Economic
growth is proportional to the square of the network entropy of a society's
population times t... | computer science |
35,927 | Resource Matchmaking Algorithm using Dynamic Rough Set in Grid
Environment | cs.DC | Grid environment is a service oriented infrastructure in which many
heterogeneous resources participate to provide the high performance
computation. One of the bug issues in the grid environment is the vagueness and
uncertainty between advertised resources and requested resources. Furthermore,
in an environment such as... | computer science |
35,928 | Interactive Data Integration through Smart Copy & Paste | cs.DB | In many scenarios, such as emergency response or ad hoc collaboration, it is
critical to reduce the overhead in integrating data. Ideally, one could perform
the entire process interactively under one unified interface: defining
extractors and wrappers for sources, creating a mediated schema, and adding
schema mappings ... | computer science |
35,929 | Greedy Gossip with Eavesdropping | cs.DC | This paper presents greedy gossip with eavesdropping (GGE), a novel
randomized gossip algorithm for distributed computation of the average
consensus problem. In gossip algorithms, nodes in the network randomly
communicate with their neighbors and exchange information iteratively. The
algorithms are simple and decentral... | computer science |
35,930 | Logic with Verbs | cs.AI | The aim of this paper is to introduce a logic in which nouns and verbs are
handled together as a deductive reasoning, and also to observe the relationship
between nouns and verbs as well as between logics and conversations. | computer science |
35,931 | Manipulation and gender neutrality in stable marriage procedures | cs.AI | The stable marriage problem is a well-known problem of matching men to women
so that no man and woman who are not married to each other both prefer each
other. Such a problem has a wide variety of practical applications ranging from
matching resident doctors to hospitals to matching students to schools. A
well-known al... | computer science |
35,932 | Breaking Generator Symmetry | cs.AI | Dealing with large numbers of symmetries is often problematic. One solution
is to focus on just symmetries that generate the symmetry group. Whilst there
are special cases where breaking just the symmetries in a generating set is
complete, there are also cases where no irredundant generating set eliminates
all symmetry... | computer science |
35,933 | K-Implementation | cs.GT | This paper discusses an interested party who wishes to influence the behavior
of agents in a game (multi-agent interaction), which is not under his control.
The interested party cannot design a new game, cannot enforce agents' behavior,
cannot enforce payments by the agents, and cannot prohibit strategies available
to ... | computer science |
35,934 | A Personalized System for Conversational Recommendations | cs.IR | Searching for and making decisions about information is becoming increasingly
difficult as the amount of information and number of choices increases.
Recommendation systems help users find items of interest of a particular type,
such as movies or restaurants, but are still somewhat awkward to use. Our
solution is to ta... | computer science |
35,935 | Can We Learn to Beat the Best Stock | cs.AI | A novel algorithm for actively trading stocks is presented. While traditional
expert advice and "universal" algorithms (as well as standard technical trading
heuristics) attempt to predict winners or trends, our approach relies on
predictable statistical relations between all pairs of stocks in the market.
Our empirica... | computer science |
35,936 | A case of combination of evidence in the Dempster-Shafer theory
inconsistent with evaluation of probabilities | math.PR | The Dempster-Shafer theory of evidence accumulation is one of the main tools
for combining data obtained from multiple sources. In this paper a special case
of combination of two bodies of evidence with non-zero conflict coefficient is
considered. It is shown that application of the Dempster-Shafer rule of
combination ... | computer science |
35,937 | Towards a Reliable Framework of Uncertainty-Based Group Decision Support
System | cs.SY | This study proposes a framework of Uncertainty-based Group Decision Support
System (UGDSS). It provides a platform for multiple criteria decision analysis
in six aspects including (1) decision environment, (2) decision problem, (3)
decision group, (4) decision conflict, (5) decision schemes and (6) group
negotiation. B... | computer science |
35,938 | Current State and Challenges of Automatic Planning in Web Service
Composition | cs.DC | This paper gives a survey on the current state of Web Service Compositions
and the difficulties and solutions to automated Web Service Compositions. This
first gives a definition of Web Service Composition and the motivation and goal
of it. It then explores into why we need automated Web Service Compositions and
formal... | computer science |
35,939 | A Survey on how Description Logic Ontologies Benefit from Formal Concept
Analysis | cs.LO | Although the notion of a concept as a collection of objects sharing certain
properties, and the notion of a conceptual hierarchy are fundamental to both
Formal Concept Analysis and Description Logics, the ways concepts are described
and obtained differ significantly between these two research areas. Despite
these diffe... | computer science |
35,940 | From decision to action : intentionality, a guide for the specification
of intelligent agents' behaviour | cs.AI | This article introduces a reflexion about behavioural specification for
interactive and participative agent-based simulation in virtual reality. Within
this context, it is neces sary to reach a high level of expressivness in order
to enforce interactions between the designer and the behavioural model during
the in-line... | computer science |
35,941 | Evolutionary Quantum Logic Synthesis of Boolean Reversible Logic
Circuits Embedded in Ternary Quantum Space using Heuristics | cs.AI | It has been experimentally proven that realizing universal quantum gates
using higher-radices logic is practically and technologically possible. We
developed a Parallel Genetic Algorithm that synthesizes Boolean reversible
circuits realized with a variety of quantum gates on qudits with various
radices. In order to all... | computer science |
35,942 | Using Variational Inference and MapReduce to Scale Topic Modeling | cs.AI | Latent Dirichlet Allocation (LDA) is a popular topic modeling technique for
exploring document collections. Because of the increasing prevalence of large
datasets, there is a need to improve the scalability of inference of LDA. In
this paper, we propose a technique called ~\emph{MapReduce LDA} (Mr. LDA) to
accommodate ... | computer science |
35,943 | On the Undecidability of Fuzzy Description Logics with GCIs with
Lukasiewicz t-norm | cs.LO | Recently there have been some unexpected results concerning Fuzzy Description
Logics (FDLs) with General Concept Inclusions (GCIs). They show that, unlike
the classical case, the DL ALC with GCIs does not have the finite model
property under Lukasiewicz Logic or Product Logic and, specifically, knowledge
base satisfiab... | computer science |
35,944 | Consistent Query Answering via ASP from Different Perspectives: Theory
and Practice | cs.DB | A data integration system provides transparent access to different data
sources by suitably combining their data, and providing the user with a unified
view of them, called global schema. However, source data are generally not
under the control of the data integration process, thus integrated data may
violate global in... | computer science |
35,945 | Higher Order Programming to Mine Knowledge for a Modern Medical Expert
System | cs.LO | Knowledge mining is the process of deriving new and useful knowledge from
vast volumes of data and background knowledge. Modern healthcare organizations
regularly generate huge amount of electronic data stored in the databases.
These data are a valuable resource for mining useful knowledge to help medical
practitioners... | computer science |
35,946 | ALPprolog --- A New Logic Programming Method for Dynamic Domains | cs.LO | Logic programming is a powerful paradigm for programming autonomous agents in
dynamic domains, as witnessed by languages such as Golog and Flux. In this work
we present ALPprolog, an expressive, yet efficient, logic programming language
for the online control of agents that have to reason about incomplete
information a... | computer science |
35,947 | Complex Optimization in Answer Set Programming | cs.LO | Preference handling and optimization are indispensable means for addressing
non-trivial applications in Answer Set Programming (ASP). However, their
implementation becomes difficult whenever they bring about a significant
increase in computational complexity. As a consequence, existing ASP systems do
not offer complex ... | computer science |
35,948 | An n-ary Constraint for the Stable Marriage Problem | cs.DS | We present an n-ary constraint for the stable marriage problem. This
constraint acts between two sets of integer variables where the domains of
those variables represent preferences. Our constraint enforces stability and
disallows bigamy. For a stable marriage instance with $n$ men and $n$ women we
require only one of ... | computer science |
35,949 | A Rough Computing based Performance Evaluation Approach for Educational
Institutions | cs.CY | Performance evaluation of various organizations especially educational
institutions is a very important area of research and needs to be cultivated
more. In this paper, we propose a performance evaluation for educational
institutions using rough set on fuzzy approximation spaces with ordering rules
and information entr... | computer science |
35,950 | Surprise: Youve got some explaining to do | cs.AI | Why are some events more surprising than others? We propose that events that
are more difficult to explain are those that are more surprising. The two
experiments reported here test the impact of different event outcomes
(Outcome-Type) and task demands (Task) on ratings of surprise for simple story
scenarios. For the O... | computer science |
35,951 | Cognitive residues of similarity | cs.AI | What are the cognitive after-effects of making a similarity judgement? What,
cognitively, is left behind and what effect might these residues have on
subsequent processing? In this paper, we probe for such after-effects using a
visual search task, performed after a task in which pictures of real-world
objects were comp... | computer science |
35,952 | Fighting Sample Degeneracy and Impoverishment in Particle Filters: A
Review of Intelligent Approaches | cs.AI | During the last two decades there has been a growing interest in Particle
Filtering (PF). However, PF suffers from two long-standing problems that are
referred to as sample degeneracy and impoverishment. We are investigating
methods that are particularly efficient at Particle Distribution Optimization
(PDO) to fight sa... | computer science |
35,953 | History Based Coalition Formation in Hedonic Context Using Trust | cs.MA | In this paper we address the problem of coalition formation in hedonic
context. Our modelling tries to be as realistic as possible. In previous
models, once an agent joins a coalition it would not be able to leave the
coalition and join the new one; in this research we made it possible to leave a
coalition but put some... | computer science |
35,954 | Decision Theory with Resource-Bounded Agents | cs.GT | There have been two major lines of research aimed at capturing
resource-bounded players in game theory. The first, initiated by Rubinstein,
charges an agent for doing costly computation; the second, initiated by Neyman,
does not charge for computation, but limits the computation that agents can do,
typically by modelin... | computer science |
35,955 | Exploiting Binary Floating-Point Representations for Constraint
Propagation: The Complete Unabridged Version | cs.AI | Floating-point computations are quickly finding their way in the design of
safety- and mission-critical systems, despite the fact that designing
floating-point algorithms is significantly more difficult than designing
integer algorithms. For this reason, verification and validation of
floating-point computations is a h... | computer science |
35,956 | Firefly Algorithm: Recent Advances and Applications | math.OC | Nature-inspired metaheuristic algorithms, especially those based on swarm
intelligence, have attracted much attention in the last ten years. Firefly
algorithm appeared in about five years ago, its literature has expanded
dramatically with diverse applications. In this paper, we will briefly review
the fundamentals of f... | computer science |
35,957 | Bat Algorithm: Literature Review and Applications | cs.AI | Bat algorithm (BA) is a bio-inspired algorithm developed by Yang in 2010 and
BA has been found to be very efficient. As a result, the literature has
expanded significantly in the last 3 years. This paper provides a timely review
of the bat algorithm and its new variants. A wide range of diverse applications
and case st... | computer science |
35,958 | A Literature Survey of Benchmark Functions For Global Optimization
Problems | cs.AI | Test functions are important to validate and compare the performance of
optimization algorithms. There have been many test or benchmark functions
reported in the literature; however, there is no standard list or set of
benchmark functions. Ideally, test functions should have diverse properties so
that can be truly usef... | computer science |
35,959 | Incentives for Privacy Tradeoff in Community Sensing | cs.GT | Community sensing, fusing information from populations of privately-held
sensors, presents a great opportunity to create efficient and cost-effective
sensing applications. Yet, reasonable privacy concerns often limit the access
to such data streams. How should systems valuate and negotiate access to
private information... | computer science |
35,960 | Matching Demand with Supply in the Smart Grid using Agent-Based
Multiunit Auction | cs.AI | Recent work has suggested reducing electricity generation cost by cutting the
peak to average ratio (PAR) without reducing the total amount of the loads.
However, most of these proposals rely on consumer's willingness to act. In this
paper, we propose an approach to cut PAR explicitly from the supply side. The
resultin... | computer science |
35,961 | Dynamic Reasoning Systems | cs.AI | A {\it dynamic reasoning system} (DRS) is an adaptation of a conventional
formal logical system that explicitly portrays reasoning as a temporal
activity, with each extralogical input to the system and each inference rule
application being viewed as occurring at a distinct time step. Every DRS
incorporates some well-de... | computer science |
35,962 | The Partner Units Configuration Problem: Completing the Picture | cs.AI | The partner units problem (PUP) is an acknowledged hard benchmark problem for
the Logic Programming community with various industrial application fields like
surveillance, electrical engineering, computer networks or railway safety
systems. However, computational complexity remained widely unclear so far. In
this paper... | computer science |
35,963 | A Hypergraph-Partitioned Vertex Programming Approach for Large-scale
Consensus Optimization | cs.AI | In modern data science problems, techniques for extracting value from big
data require performing large-scale optimization over heterogenous, irregularly
structured data. Much of this data is best represented as multi-relational
graphs, making vertex programming abstractions such as those of Pregel and
GraphLab ideal f... | computer science |
35,964 | The Application of Fuzzy Logic to the Construction of the Ranking
Function of Information Retrieval Systems | cs.IR | The quality of the ranking function is an important factor that determines
the quality of the Information Retrieval system. Each document is assigned a
score by the ranking function; the score indicates the likelihood of relevance
of the document given a query. In the vector space model, the ranking function
is defined... | computer science |
35,965 | Language, logic and ontology: uncovering the structure of commonsense
knowledge | cs.AI | The purpose of this paper is twofold: (i) we argue that the structure of
commonsense knowledge must be discovered, rather than invented; and (ii) we
argue that natural language, which is the best known theory of our (shared)
commonsense knowledge, should itself be used as a guide to discovering the
structure of commons... | computer science |
35,966 | On Geometric Algebra representation of Binary Spatter Codes | cs.AI | Kanerva's Binary Spatter Codes are reformulated in terms of geometric
algebra. The key ingredient of the construction is the representation of XOR
binding in terms of geometric product. | computer science |
35,967 | Solving planning domains with polytree causal graphs is NP-complete | cs.AI | We show that solving planning domains on binary variables with polytree
causal graph is \NP-complete. This is in contrast to a polynomial-time
algorithm of Domshlak and Brafman that solves these planning domains for
polytree causal graphs of bounded indegree. | computer science |
35,968 | Reuse of designs: Desperately seeking an interdisciplinary cognitive
approach | cs.HC | This text analyses the papers accepted for the workshop "Reuse of designs: an
interdisciplinary cognitive approach". Several dimensions and questions
considered as important (by the authors and/or by us) are addressed: What about
the "interdisciplinary cognitive" character of the approaches adopted by the
authors? Is d... | computer science |
35,969 | Social Browsing on Flickr | cs.HC | The new social media sites - blogs, wikis, del.icio.us and Flickr, among
others - underscore the transformation of the Web to a participatory medium in
which users are actively creating, evaluating and distributing information. The
photo-sharing site Flickr, for example, allows users to upload photographs,
view photos ... | computer science |
35,970 | Hybrid Reasoning and the Future of Iconic Representations | cs.AI | We give a brief overview of the main characteristics of diagrammatic
reasoning, analyze a case of human reasoning in a mastermind game, and explain
why hybrid representation systems (HRS) are particularly attractive and
promising for Artificial General Intelligence and Computer Science in general. | computer science |
35,971 | An Ant-Based Model for Multiple Sequence Alignment | cs.AI | Multiple sequence alignment is a key process in today's biology, and finding
a relevant alignment of several sequences is much more challenging than just
optimizing some improbable evaluation functions. Our approach for addressing
multiple sequence alignment focuses on the building of structures in a new
graph model: t... | computer science |
35,972 | Conditioning Probabilistic Databases | cs.DB | Past research on probabilistic databases has studied the problem of answering
queries on a static database. Application scenarios of probabilistic databases
however often involve the conditioning of a database using additional
information in the form of new evidence. The conditioning problem is thus to
transform a prob... | computer science |
35,973 | Preferred extensions as stable models | cs.AI | Given an argumentation framework AF, we introduce a mapping function that
constructs a disjunctive logic program P, such that the preferred extensions of
AF correspond to the stable models of P, after intersecting each stable model
with the relevant atoms. The given mapping function is of polynomial size
w.r.t. AF. In ... | computer science |
35,974 | Combinatorial Explorations in Su-Doku | cs.AI | Su-Doku, a popular combinatorial puzzle, provides an excellent testbench for
heuristic explorations. Several interesting questions arise from its
deceptively simple set of rules. How many distinct Su-Doku grids are there? How
to find a solution to a Su-Doku puzzle? Is there a unique solution to a given
Su-Doku puzzle? ... | computer science |
35,975 | Grammar-Based Random Walkers in Semantic Networks | cs.AI | Semantic networks qualify the meaning of an edge relating any two vertices.
Determining which vertices are most "central" in a semantic network is
difficult because one relationship type may be deemed subjectively more
important than another. For this reason, research into semantic network metrics
has focused primarily... | computer science |
35,976 | Probabilistic reasoning with answer sets | cs.AI | This paper develops a declarative language, P-log, that combines logical and
probabilistic arguments in its reasoning. Answer Set Prolog is used as the
logical foundation, while causal Bayes nets serve as a probabilistic
foundation. We give several non-trivial examples and illustrate the use of
P-log for knowledge repr... | computer science |
35,977 | Justifications for Logic Programs under Answer Set Semantics | cs.AI | The paper introduces the notion of off-line justification for Answer Set
Programming (ASP). Justifications provide a graph-based explanation of the
truth value of an atom w.r.t. a given answer set. The paper extends also this
notion to provide justification of atoms during the computation of an answer
set (on-line just... | computer science |
35,978 | An analysis of a random algorithm for estimating all the matchings | cs.GR | Counting the number of all the matchings on a bipartite graph has been
transformed into calculating the permanent of a matrix obtained from the
extended bipartite graph by Yan Huo, and Rasmussen presents a simple approach
(RM) to approximate the permanent, which just yields a critical ratio
O($n\omega(n)$) for almost a... | computer science |
35,979 | Emerge-Sort: Converging to Ordered Sequences by Simple Local Operators | cs.AI | In this paper we examine sorting on the assumption that we do not know in
advance which way to sort a sequence of numbers and we set at work simple local
comparison and swap operators whose repeating application ends up in sorted
sequences. These are the basic elements of Emerge-Sort, our approach to
self-organizing so... | computer science |
35,980 | Multi-Agent Reinforcement Learning and Genetic Policy Sharing | cs.MA | The effects of policy sharing between agents in a multi-agent dynamical
system has not been studied extensively. I simulate a system of agents
optimizing the same task using reinforcement learning, to study the effects of
different population densities and policy sharing. I demonstrate that sharing
policies decreases t... | computer science |
35,981 | A New Trend in Optimization on Multi Overcomplete Dictionary toward
Inpainting | cs.MM | Recently, great attention was intended toward overcomplete dictionaries and
the sparse representations they can provide. In a wide variety of signal
processing problems, sparsity serves a crucial property leading to high
performance. Inpainting, the process of reconstructing lost or deteriorated
parts of images or vide... | computer science |
35,982 | Probabilistic SVM/GMM Classifier for Speaker-Independent Vowel
Recognition in Continues Speech | cs.MM | In this paper, we discuss the issues in automatic recognition of vowels in
Persian language. The present work focuses on new statistical method of
recognition of vowels as a basic unit of syllables. First we describe a vowel
detection system then briefly discuss how the detected vowels can feed to
recognition unit. Acc... | computer science |
35,983 | New parallel programming language design: a bridge between brain models
and multi-core/many-core computers? | cs.PL | The recurrent theme of this paper is that sequences of long temporal patterns
as opposed to sequences of simple statements are to be fed into computation
devices, being them (new proposed) models for brain activity or
multi-core/many-core computers. In such models, parts of these long temporal
patterns are already comm... | computer science |
35,984 | A New Method for Knowledge Representation in Expert System's (XMLKR) | cs.DC | Knowledge representation it is an essential section of a Expert Systems,
Because in this section we have a framework to establish an expert system then
we can modeling and use by this to design an expert system. Many method it is
exist for knowledge representation but each method have problems, in this paper
we introdu... | computer science |
35,985 | Accelerating and Evaluation of Syntactic Parsing in Natural Language
Question Answering Systems | cs.AI | With the development of Natural Language Processing (NLP), more and more
systems want to adopt NLP in User Interface Module to process user input, in
order to communicate with user in a natural way. However, this raises a speed
problem. That is, if NLP module can not process sentences in durable time
delay, users will ... | computer science |
35,986 | Faith in the Algorithm, Part 1: Beyond the Turing Test | cs.CY | Since the Turing test was first proposed by Alan Turing in 1950, the primary
goal of artificial intelligence has been predicated on the ability for
computers to imitate human behavior. However, the majority of uses for the
computer can be said to fall outside the domain of human abilities and it is
exactly outside of t... | computer science |
35,987 | Impact of Cognitive Radio on Future Management of Spectrum | cs.AI | Cognitive radio is a breakthrough technology which is expected to have a
profound impact on the way radio spectrum will be accessed, managed and shared
in the future. In this paper I examine some of the implications of cognitive
radio for future management of spectrum. Both a near-term view involving the
opportunistic ... | computer science |
35,988 | Filtering Algorithms for the Multiset Ordering Constraint | cs.AI | Constraint programming (CP) has been used with great success to tackle a wide
variety of constraint satisfaction problems which are computationally
intractable in general. Global constraints are one of the important factors
behind the success of CP. In this paper, we study a new global constraint, the
multiset ordering... | computer science |
35,989 | The Parameterized Complexity of Global Constraints | cs.AI | We argue that parameterized complexity is a useful tool with which to study
global constraints. In particular, we show that many global constraints which
are intractable to propagate completely have natural parameters which make them
fixed-parameter tractable and which are easy to compute. This tractability
tends eithe... | computer science |
35,990 | Decompositions of Grammar Constraints | cs.AI | A wide range of constraints can be compactly specified using automata or
formal languages. In a sequence of recent papers, we have shown that an
effective means to reason with such specifications is to decompose them into
primitive constraints. We can then, for instance, use state of the art SAT
solvers and profit from... | computer science |
35,991 | SLIDE: A Useful Special Case of the CARDPATH Constraint | cs.AI | We study the CardPath constraint. This ensures a given constraint holds a
number of times down a sequence of variables. We show that SLIDE, a special
case of CardPath where the slid constraint must hold always, can be used to
encode a wide range of sliding sequence constraints including CardPath itself.
We consider how... | computer science |
35,992 | Algorithms for Weighted Boolean Optimization | cs.AI | The Pseudo-Boolean Optimization (PBO) and Maximum Satisfiability (MaxSAT)
problems are natural optimization extensions of Boolean Satisfiability (SAT).
In the recent past, different algorithms have been proposed for PBO and for
MaxSAT, despite the existence of straightforward mappings from PBO to MaxSAT
and vice-vers... | computer science |
35,993 | Decomposition, Reformulation, and Diving in University Course
Timetabling | cs.DS | In many real-life optimisation problems, there are multiple interacting
components in a solution. For example, different components might specify
assignments to different kinds of resource. Often, each component is associated
with different sets of soft constraints, and so with different measures of soft
constraint vio... | computer science |
35,994 | Symmetry Breaking Using Value Precedence | cs.AI | We present a comprehensive study of the use of value precedence constraints
to break value symmetry. We first give a simple encoding of value precedence
into ternary constraints that is both efficient and effective at breaking
symmetry. We then extend value precedence to deal with a number of
generalizations like wreat... | computer science |
35,995 | The Complexity of Reasoning with Global Constraints | cs.AI | Constraint propagation is one of the techniques central to the success of
constraint programming. To reduce search, fast algorithms associated with each
constraint prune the domains of variables. With global (or non-binary)
constraints, the cost of such propagation may be much greater than the
quadratic cost for binary... | computer science |
35,996 | Breaking Value Symmetry | cs.AI | One common type of symmetry is when values are symmetric. For example, if we
are assigning colours (values) to nodes (variables) in a graph colouring
problem then we can uniformly interchange the colours throughout a colouring.
For a problem with value symmetries, all symmetric solutions can be eliminated
in polynomial... | computer science |
35,997 | Tetravex is NP-complete | cs.CC | Tetravex is a widely played one person computer game in which you are given
$n^2$ unit tiles, each edge of which is labelled with a number. The objective
is to place each tile within a $n$ by $n$ square such that all neighbouring
edges are labelled with an identical number. Unfortunately, playing Tetravex is
computatio... | computer science |
35,998 | Contracting preference relations for database applications | cs.AI | The binary relation framework has been shown to be applicable to many
real-life preference handling scenarios. Here we study preference contraction:
the problem of discarding selected preferences. We argue that the property of
minimality and the preservation of strict partial orders are crucial for
contractions. Contra... | computer science |
35,999 | Airport Gate Assignment A Hybrid Model and Implementation | cs.AI | With the rapid development of airlines, airports today become much busier and
more complicated than previous days. During airlines daily operations,
assigning the available gates to the arriving aircrafts based on the fixed
schedule is a very important issue, which motivates researchers to study and
solve Airport Gate ... | computer science |
36,000 | Quantum decision theory as quantum theory of measurement | cs.AI | We present a general theory of quantum information processing devices, that
can be applied to human decision makers, to atomic multimode registers, or to
molecular high-spin registers. Our quantum decision theory is a generalization
of the quantum theory of measurement, endowed with an action ring, a prospect
lattice a... | computer science |
36,001 | Mining Compressed Repetitive Gapped Sequential Patterns Efficiently | cs.DB | Mining frequent sequential patterns from sequence databases has been a
central research topic in data mining and various efficient mining sequential
patterns algorithms have been proposed and studied. Recently, in many problem
domains (e.g, program execution traces), a novel sequential pattern mining
research, called m... | computer science |
36,002 | The CIFF Proof Procedure for Abductive Logic Programming with
Constraints: Theory, Implementation and Experiments | cs.AI | We present the CIFF proof procedure for abductive logic programming with
constraints, and we prove its correctness. CIFF is an extension of the IFF
proof procedure for abductive logic programming, relaxing the original
restrictions over variable quantification (allowedness conditions) and
incorporating a constraint sol... | computer science |
36,003 | On Defining 'I' "I logy" | cs.AI | Could we define I? Throughout this article we give a negative answer to this
question. More exactly, we show that there is no definition for I in a certain
way. But this negative answer depends on our definition of definability. Here,
we try to consider sufficient generalized definition of definability. In the
middle o... | computer science |
36,004 | Managing Requirement Volatility in an Ontology-Driven Clinical LIMS
Using Category Theory. International Journal of Telemedicine and Applications | cs.AI | Requirement volatility is an issue in software engineering in general, and in
Web-based clinical applications in particular, which often originates from an
incomplete knowledge of the domain of interest. With advances in the health
science, many features and functionalities need to be added to, or removed
from, existin... | computer science |
36,005 | Towards Improving Validation, Verification, Crash Investigations, and
Event Reconstruction of Flight-Critical Systems with Self-Forensics | cs.SE | This paper introduces a novel concept of self-forensics to complement the
standard autonomic self-CHOP properties of the self-managed systems, to be
specified in the Forensic Lucid language. We argue that self-forensics, with
the forensics taken out of the cybercrime domain, is applicable to
"self-dissection" for the p... | computer science |
36,006 | Characterising equilibrium logic and nested logic programs: Reductions
and complexity | cs.LO | Equilibrium logic is an approach to nonmonotonic reasoning that extends the
stable-model and answer-set semantics for logic programs. In particular, it
includes the general case of nested logic programs, where arbitrary Boolean
combinations are permitted in heads and bodies of rules, as special kinds of
theories. In th... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.