Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
19,502 | Search-Space Characterization for Real-time Heuristic Search | cs.AI | Recent real-time heuristic search algorithms have demonstrated outstanding
performance in video-game pathfinding. However, their applications have been
thus far limited to that domain. We proceed with the aim of facilitating wider
applications of real-time search by fostering a greater understanding of the
performance ... | computer science |
19,503 | POMDPs under Probabilistic Semantics | cs.AI | We consider partially observable Markov decision processes (POMDPs) with
limit-average payoff, where a reward value in the interval [0,1] is associated
to every transition, and the payoff of an infinite path is the long-run average
of the rewards. We consider two types of path constraints: (i) quantitative
constraint d... | computer science |
19,504 | David Poole's Specificity Revised | cs.AI | In the middle of the 1980s, David Poole introduced a semantical,
model-theoretic notion of specificity to the artificial-intelligence community.
Since then it has found further applications in non-monotonic reasoning, in
particular in defeasible reasoning. Poole tried to approximate the intuitive
human concept of speci... | computer science |
19,505 | The Fractal Dimension of SAT Formulas | cs.AI | Modern SAT solvers have experienced a remarkable progress on solving
industrial instances. Most of the techniques have been developed after an
intensive experimental testing process. Recently, there have been some attempts
to analyze the structure of these formulas in terms of complex networks, with
the long-term aim o... | computer science |
19,506 | Extending Similarity Measures of Interval Type-2 Fuzzy Sets to General
Type-2 Fuzzy Sets | cs.AI | Similarity measures provide one of the core tools that enable reasoning about
fuzzy sets. While many types of similarity measures exist for type-1 and
interval type-2 fuzzy sets, there are very few similarity measures that enable
the comparison of general type-2 fuzzy sets. In this paper, we introduce a
general method ... | computer science |
19,507 | Measuring the Directional Distance Between Fuzzy Sets | cs.AI | The measure of distance between two fuzzy sets is a fundamental tool within
fuzzy set theory. However, current distance measures within the literature do
not account for the direction of change between fuzzy sets; a useful concept in
a variety of applications, such as Computing With Words. In this paper, we
highlight t... | computer science |
19,508 | Evolution Theory of Self-Evolving Autonomous Problem Solving Systems | cs.AI | The present study gives a mathematical framework for self-evolution within
autonomous problem solving systems. Special attention is set on universal
abstraction, thereof generation by net block homomorphism, consequently
multiple order solving systems and the overall decidability of the set of the
solutions. By overlap... | computer science |
19,509 | Verification of Semantically-Enhanced Artifact Systems (Extended
Version) | cs.AI | Artifact-Centric systems have emerged in the last years as a suitable
framework to model business-relevant entities, by combining their static and
dynamic aspects. In particular, the Guard-Stage-Milestone (GSM) approach has
been recently proposed to model artifacts and their lifecycle in a declarative
way. In this pape... | computer science |
19,510 | A Typed Hybrid Description Logic Programming Language with Polymorphic
Order-Sorted DL-Typed Unification for Semantic Web Type Systems | cs.AI | In this paper we elaborate on a specific application in the context of hybrid
description logic programs (hybrid DLPs), namely description logic Semantic Web
type systems (DL-types) which are used for term typing of LP rules based on a
polymorphic, order-sorted, hybrid DL-typed unification as procedural semantics
of hy... | computer science |
19,511 | Why did the accident happen? A norm-based reasoning approach | cs.AI | In this paper we describe an architecture of a system that answer the
question : Why did the accident happen? from the textual description of an
accident. We present briefly the different parts of the architecture and then
we describe with more detail the semantic part of the system i.e. the part in
which the norm-base... | computer science |
19,512 | Une expérience de sémantique inférentielle | cs.AI | We develop a system which must be able to perform the same inferences that a
human reader of an accident report can do and more particularly to determine
the apparent causes of the accident. We describe the general framework in which
we are situated, linguistic and semantic levels of the analysis and the
inference rule... | computer science |
19,513 | Farthest-Point Heuristic based Initialization Methods for K-Modes
Clustering | cs.AI | The k-modes algorithm has become a popular technique in solving categorical
data clustering problems in different application domains. However, the
algorithm requires random selection of initial points for the clusters.
Different initial points often lead to considerable distinct clustering
results. In this paper we pr... | computer science |
19,514 | Comparing Typical Opening Move Choices Made by Humans and Chess Engines | cs.AI | The opening book is an important component of a chess engine, and thus
computer chess programmers have been developing automated methods to improve
the quality of their books. For chess, which has a very rich opening theory,
large databases of high-quality games can be used as the basis of an opening
book, from which s... | computer science |
19,515 | Local approximate inference algorithms | cs.AI | We present a new local approximation algorithm for computing Maximum a
Posteriori (MAP) and log-partition function for arbitrary exponential family
distribution represented by a finite-valued pair-wise Markov random field
(MRF), say $G$. Our algorithm is based on decomposition of $G$ into {\em
appropriately} chosen sma... | computer science |
19,516 | Constant for associative patterns ensemble | cs.AI | Creation procedure of associative patterns ensemble in terms of formal logic
with using neural net-work (NN) model is formulated. It is shown that the
associative patterns set is created by means of unique procedure of NN work
which having individual parameters of entrance stimulus transformation. It is
ascer-tained th... | computer science |
19,517 | Adaptation Knowledge Discovery from a Case Base | cs.AI | In case-based reasoning, the adaptation step depends in general on
domain-dependent knowledge, which motivates studies on adaptation knowledge
acquisition (AKA). CABAMAKA is an AKA system based on principles of knowledge
discovery from databases. This system explores the variations within the case
base to elicit adapta... | computer science |
19,518 | Decentralized Failure Diagnosis of Stochastic Discrete Event Systems | cs.AI | Recently, the diagnosability of {\it stochastic discrete event systems}
(SDESs) was investigated in the literature, and, the failure diagnosis
considered was {\it centralized}. In this paper, we propose an approach to {\it
decentralized} failure diagnosis of SDESs, where the stochastic system uses
multiple local diagno... | computer science |
19,519 | DSmT: A new paradigm shift for information fusion | cs.AI | The management and combination of uncertain, imprecise, fuzzy and even
paradoxical or high conflicting sources of information has always been and
still remains of primal importance for the development of reliable information
fusion systems. In this short survey paper, we present the theory of plausible
and paradoxical ... | computer science |
19,520 | Conscious Intelligent Systems - Part 1 : I X I | cs.AI | Did natural consciousness and intelligent systems arise out of a path that
was co-evolutionary to evolution? Can we explain human self-consciousness as
having risen out of such an evolutionary path? If so how could it have been?
In this first part of a two-part paper (titled IXI), we take a learning
system perspectiv... | computer science |
19,521 | Conscious Intelligent Systems - Part II - Mind, Thought, Language and
Understanding | cs.AI | This is the second part of a paper on Conscious Intelligent Systems. We use
the understanding gained in the first part (Conscious Intelligent Systems Part
1: IXI (arxiv id cs.AI/0612056)) to look at understanding. We see how the
presence of mind affects understanding and intelligent systems; we see that the
presence of... | computer science |
19,522 | Interactive Configuration by Regular String Constraints | cs.AI | A product configurator which is complete, backtrack free and able to compute
the valid domains at any state of the configuration can be constructed by
building a Binary Decision Diagram (BDD). Despite the fact that the size of the
BDD is exponential in the number of variables in the worst case, BDDs have
proved to work... | computer science |
19,523 | Truncating the loop series expansion for Belief Propagation | cs.AI | Recently, M. Chertkov and V.Y. Chernyak derived an exact expression for the
partition sum (normalization constant) corresponding to a graphical model,
which is an expansion around the Belief Propagation solution. By adding
correction terms to the BP free energy, one for each "generalized loop" in the
factor graph, the ... | computer science |
19,524 | The Future of Scientific Simulations: from Artificial Life to Artificial
Cosmogenesis | cs.AI | This philosophical paper explores the relation between modern scientific
simulations and the future of the universe. We argue that a simulation of an
entire universe will result from future scientific activity. This requires us
to tackle the challenge of simulating open-ended evolution at all levels in a
single simulat... | computer science |
19,525 | Serious Flaws in Korf et al.'s Analysis on Time Complexity of A* | cs.AI | This paper has been withdrawn. | computer science |
19,526 | Eye-Tracking Evolutionary Algorithm to minimize user's fatigue in IEC
applied to Interactive One-Max problem | cs.AI | In this paper, we describe a new algorithm that consists in combining an
eye-tracker for minimizing the fatigue of a user during the evaluation process
of Interactive Evolutionary Computation. The approach is then applied to the
Interactive One-Max optimization problem. | computer science |
19,527 | Node discovery in a networked organization | cs.AI | In this paper, I present a method to solve a node discovery problem in a
networked organization. Covert nodes refer to the nodes which are not
observable directly. They affect social interactions, but do not appear in the
surveillance logs which record the participants of the social interactions.
Discovering the covert... | computer science |
19,528 | Multiagent Approach for the Representation of Information in a Decision
Support System | cs.AI | In an emergency situation, the actors need an assistance allowing them to
react swiftly and efficiently. In this prospect, we present in this paper a
decision support system that aims to prepare actors in a crisis situation
thanks to a decision-making support. The global architecture of this system is
presented in the ... | computer science |
19,529 | Reflective visualization and verbalization of unconscious preference | cs.AI | A new method is presented, that can help a person become aware of his or her
unconscious preferences, and convey them to others in the form of verbal
explanation. The method combines the concepts of reflection, visualization, and
verbalization. The method was tested in an experiment where the unconscious
preferences of... | computer science |
19,530 | Elementary epistemological features of machine intelligence | cs.AI | Theoretical analysis of machine intelligence (MI) is useful for defining a
common platform in both theoretical and applied artificial intelligence (AI).
The goal of this paper is to set canonical definitions that can assist
pragmatic research in both strong and weak AI. Described epistemological
features of machine int... | computer science |
19,531 | Logic programs with propositional connectives and aggregates | cs.AI | Answer set programming (ASP) is a logic programming paradigm that can be used
to solve complex combinatorial search problems. Aggregates are an ASP construct
that plays an important role in many applications. Defining a satisfactory
semantics of aggregates turned out to be a difficult problem, and in this paper
we prop... | computer science |
19,532 | Identification of parameters underlying emotions and a classification of
emotions | cs.AI | The standard classification of emotions involves categorizing the expression
of emotions. In this paper, parameters underlying some emotions are identified
and a new classification based on these parameters is suggested. | computer science |
19,533 | Prediction of Platinum Prices Using Dynamically Weighted Mixture of
Experts | cs.AI | Neural networks are powerful tools for classification and regression in
static environments. This paper describes a technique for creating an ensemble
of neural networks that adapts dynamically to changing conditions. The model
separates the input space into four regions and each network is given a weight
in each regio... | computer science |
19,534 | Analyse et structuration automatique des guides de bonnes pratiques
cliniques : essai d'évaluation | cs.AI | Health Practice Guideliens are supposed to unify practices and propose
recommendations to physicians. This paper describes GemFrame, a system capable
of semi-automatically filling an XML template from free texts in the clinical
domain. The XML template includes semantic information not explicitly encoded
in the text (p... | computer science |
19,535 | Automatic Construction of Lightweight Domain Ontologies for Chemical
Engineering Risk Management | cs.AI | The need for domain ontologies in mission critical applications such as risk
management and hazard identification is becoming more and more pressing. Most
research on ontology learning conducted in the academia remains unrealistic for
real-world applications. One of the main problems is the dependence on
non-incrementa... | computer science |
19,536 | Learning DTW Global Constraint for Time Series Classification | cs.AI | 1-Nearest Neighbor with the Dynamic Time Warping (DTW) distance is one of the
most effective classifiers on time series domain. Since the global constraint
has been introduced in speech community, many global constraint models have
been proposed including Sakoe-Chiba (S-C) band, Itakura Parallelogram, and
Ratanamahatan... | computer science |
19,537 | Range and Roots: Two Common Patterns for Specifying and Propagating
Counting and Occurrence Constraints | cs.AI | We propose Range and Roots which are two common patterns useful for
specifying a wide range of counting and occurrence constraints. We design
specialised propagation algorithms for these two patterns. Counting and
occurrence constraints specified using these patterns thus directly inherit a
propagation algorithm. To il... | computer science |
19,538 | An introduction to DSmT | cs.AI | The management and combination of uncertain, imprecise, fuzzy and even
paradoxical or high conflicting sources of information has always been, and
still remains today, of primal importance for the development of reliable
modern information systems involving artificial reasoning. In this
introduction, we present a surve... | computer science |
19,539 | Granularity-Adaptive Proof Presentation | cs.AI | When mathematicians present proofs they usually adapt their explanations to
their didactic goals and to the (assumed) knowledge of their addressees. Modern
automated theorem provers, in contrast, present proofs usually at a fixed level
of detail (also called granularity). Often these presentations are neither
intended ... | computer science |
19,540 | Breaking Value Symmetry | cs.AI | Symmetry is an important factor in solving many constraint satisfaction
problems. One common type of symmetry is when we have symmetric values. In a
recent series of papers, we have studied methods to break value symmetries. Our
results identify computational limits on eliminating value symmetry. For
instance, we prove... | computer science |
19,541 | Reformulating Global Grammar Constraints | cs.AI | An attractive mechanism to specify global constraints in rostering and other
domains is via formal languages. For instance, the Regular and Grammar
constraints specify constraints in terms of the languages accepted by an
automaton and a context-free grammar respectively. Taking advantage of the
fixed length of the cons... | computer science |
19,542 | Combining Symmetry Breaking and Global Constraints | cs.AI | We propose a new family of constraints which combine together lexicographical
ordering constraints for symmetry breaking with other common global
constraints. We give a general purpose propagator for this family of
constraints, and show how to improve its complexity by exploiting properties of
the included global const... | computer science |
19,543 | Online Estimation of SAT Solving Runtime | cs.AI | We present an online method for estimating the cost of solving SAT problems.
Modern SAT solvers present several challenges to estimate search cost including
non-chronological backtracking, learning and restarts. Our method uses a linear
model trained on data gathered at the start of search. We show the
effectiveness of... | computer science |
19,544 | On Requirements for Programming Exercises from an E-learning Perspective | cs.AI | In this work, we deal with the question of modeling programming exercises for
novices pointing to an e-learning scenario. Our purpose is to identify basic
requirements, raise some key questions and propose potential answers from a
conceptual perspective. Presented as a general picture, we hypothetically
situate our wor... | computer science |
19,545 | Tagging multimedia stimuli with ontologies | cs.AI | Successful management of emotional stimuli is a pivotal issue concerning
Affective Computing (AC) and the related research. As a subfield of Artificial
Intelligence, AC is concerned not only with the design of computer systems and
the accompanying hardware that can recognize, interpret, and process human
emotions, but ... | computer science |
19,546 | Stochastic Constraint Programming: A Scenario-Based Approach | cs.AI | To model combinatorial decision problems involving uncertainty and
probability, we introduce scenario based stochastic constraint programming.
Stochastic constraint programs contain both decision variables, which we can
set, and stochastic variables, which follow a discrete probability
distribution. We provide a semant... | computer science |
19,547 | Stochastic Constraint Programming | cs.AI | To model combinatorial decision problems involving uncertainty and
probability, we introduce stochastic constraint programming. Stochastic
constraint programs contain both decision variables (which we can set) and
stochastic variables (which follow a probability distribution). They combine
together the best features of... | computer science |
19,548 | Designing a GUI for Proofs - Evaluation of an HCI Experiment | cs.AI | Often user interfaces of theorem proving systems focus on assisting
particularly trained and skilled users, i.e., proof experts. As a result, the
systems are difficult to use for non-expert users. This paper describes a paper
and pencil HCI experiment, in which (non-expert) students were asked to make
suggestions for a... | computer science |
19,549 | Flow of Activity in the Ouroboros Model | cs.AI | The Ouroboros Model is a new conceptual proposal for an algorithmic structure
for efficient data processing in living beings as well as for artificial
agents. Its central feature is a general repetitive loop where one iteration
cycle sets the stage for the next. Sensory input activates data structures
(schemata) with s... | computer science |
19,550 | Heterogeneous knowledge representation using a finite automaton and
first order logic: a case study in electromyography | cs.AI | In a certain number of situations, human cognitive functioning is difficult
to represent with classical artificial intelligence structures. Such a
difficulty arises in the polyneuropathy diagnosis which is based on the spatial
distribution, along the nerve fibres, of lesions, together with the synthesis
of several part... | computer science |
19,551 | Knowledge Management in Economic Intelligence with Reasoning on Temporal
Attributes | cs.AI | People have to make important decisions within a time frame. Hence, it is
imperative to employ means or strategy to aid effective decision making.
Consequently, Economic Intelligence (EI) has emerged as a field to aid
strategic and timely decision making in an organization. In the course of
attaining this goal: it is i... | computer science |
19,552 | Toward a Category Theory Design of Ontological Knowledge Bases | cs.AI | I discuss (ontologies_and_ontological_knowledge_bases /
formal_methods_and_theories) duality and its category theory extensions as a
step toward a solution to Knowledge-Based Systems Theory. In particular I focus
on the example of the design of elements of ontologies and ontological
knowledge bases of next three electr... | computer science |
19,553 | Mnesors for automatic control | cs.AI | Mnesors are defined as elements of a semimodule over the min-plus integers.
This two-sorted structure is able to merge graduation properties of vectors and
idempotent properties of boolean numbers, which makes it appropriate for hybrid
systems. We apply it to the control of an inverted pendulum and design a full
logica... | computer science |
19,554 | Semi-Myopic Sensing Plans for Value Optimization | cs.AI | We consider the following sequential decision problem. Given a set of items
of unknown utility, we need to select one of as high a utility as possible
(``the selection problem''). Measurements (possibly noisy) of item values prior
to selection are allowed, at a known cost. The goal is to optimize the overall
sequential... | computer science |
19,555 | Updating Sets of Probabilities | cs.AI | There are several well-known justifications for conditioning as the
appropriate method for updating a single probability measure, given an
observation. However, there is a significant body of work arguing for sets of
probability measures, rather than single measures, as a more realistic model of
uncertainty. Conditioni... | computer science |
19,556 | A Novel Two-Stage Dynamic Decision Support based Optimal Threat
Evaluation and Defensive Resource Scheduling Algorithm for Multi Air-borne
threats | cs.AI | This paper presents a novel two-stage flexible dynamic decision support based
optimal threat evaluation and defensive resource scheduling algorithm for
multi-target air-borne threats. The algorithm provides flexibility and
optimality by swapping between two objective functions, i.e. the preferential
and subtractive def... | computer science |
19,557 | General combination rules for qualitative and quantitative beliefs | cs.AI | Martin and Osswald \cite{Martin07} have recently proposed many
generalizations of combination rules on quantitative beliefs in order to manage
the conflict and to consider the specificity of the responses of the experts.
Since the experts express themselves usually in natural language with
linguistic labels, Smarandach... | computer science |
19,558 | A Novel Two-Staged Decision Support based Threat Evaluation and Weapon
Assignment Algorithm, Asset-based Dynamic Weapon Scheduling using Artificial
Intelligence Techinques | cs.AI | Surveillance control and reporting (SCR) system for air threats play an
important role in the defense of a country. SCR system corresponds to air and
ground situation management/processing along with information fusion,
communication, coordination, simulation and other critical defense oriented
tasks. Threat Evaluation... | computer science |
19,559 | Generalized Collective Inference with Symmetric Clique Potentials | cs.AI | Collective graphical models exploit inter-instance associative dependence to
output more accurate labelings. However existing models support very limited
kind of associativity which restricts accuracy gains. This paper makes two
major contributions. First, we propose a general collective inference framework
that biases... | computer science |
19,560 | The Soft Cumulative Constraint | cs.AI | This research report presents an extension of Cumulative of Choco constraint
solver, which is useful to encode over-constrained cumulative problems. This
new global constraint uses sweep and task interval violation-based algorithms. | computer science |
19,561 | Modelling Concurrent Behaviors in the Process Specification Language | cs.AI | In this paper, we propose a first-order ontology for generalized stratified
order structure. We then classify the models of the theory using
model-theoretic techniques. An ontology mapping from this ontology to the core
theory of Process Specification Language is also discussed. | computer science |
19,562 | The Single Machine Total Weighted Tardiness Problem - Is it (for
Metaheuristics) a Solved Problem ? | cs.AI | The article presents a study of rather simple local search heuristics for the
single machine total weighted tardiness problem (SMTWTP), namely hillclimbing
and Variable Neighborhood Search. In particular, we revisit these approaches
for the SMTWTP as there appears to be a lack of appropriate/challenging
benchmark insta... | computer science |
19,563 | Improvements for multi-objective flow shop scheduling by Pareto Iterated
Local Search | cs.AI | The article describes the proposition and application of a local search
metaheuristic for multi-objective optimization problems. It is based on two
main principles of heuristic search, intensification through variable
neighborhoods, and diversification through perturbations and successive
iterations in favorable region... | computer science |
19,564 | Beyond Turing Machines | cs.AI | This paper discusses "computational" systems capable of "computing" functions
not computable by predefined Turing machines if the systems are not isolated
from their environment. Roughly speaking, these systems can change their finite
descriptions by interacting with their environment. | computer science |
19,565 | Pattern Recognition Theory of Mind | cs.AI | I propose that pattern recognition, memorization and processing are key
concepts that can be a principle set for the theoretical modeling of the mind
function. Most of the questions about the mind functioning can be answered by a
descriptive modeling and definitions from these principles. An understandable
consciousnes... | computer science |
19,566 | Fact Sheet on Semantic Web | cs.AI | The report gives an overview about activities on the topic Semantic Web. It
has been released as technical report for the project "KTweb -- Connecting
Knowledge Technologies Communities" in 2003. | computer science |
19,567 | Restart Strategy Selection using Machine Learning Techniques | cs.AI | Restart strategies are an important factor in the performance of
conflict-driven Davis Putnam style SAT solvers. Selecting a good restart
strategy for a problem instance can enhance the performance of a solver.
Inspired by recent success applying machine learning techniques to predict the
runtime of SAT solvers, we pre... | computer science |
19,568 | Online Search Cost Estimation for SAT Solvers | cs.AI | We present two different methods for estimating the cost of solving SAT
problems. The methods focus on the online behaviour of the backtracking solver,
as well as the structure of the problem. Modern SAT solvers present several
challenges to estimate search cost including coping with nonchronological
backtracking, lear... | computer science |
19,569 | On Classification from Outlier View | cs.AI | Classification is the basis of cognition. Unlike other solutions, this study
approaches it from the view of outliers. We present an expanding algorithm to
detect outliers in univariate datasets, together with the underlying
foundation. The expanding algorithm runs in a holistic way, making it a rather
robust solution. ... | computer science |
19,570 | Convergence of Expected Utility for Universal AI | cs.AI | We consider a sequence of repeated interactions between an agent and an
environment. Uncertainty about the environment is captured by a probability
distribution over a space of hypotheses, which includes all computable
functions. Given a utility function, we can evaluate the expected utility of
any computational policy... | computer science |
19,571 | Building upon Fast Multipole Methods to Detect and Model Organizations | cs.AI | Many models in natural and social sciences are comprised of sets of
inter-acting entities whose intensity of interaction decreases with distance.
This often leads to structures of interest in these models composed of dense
packs of entities. Fast Multipole Methods are a family of methods developed to
help with the calc... | computer science |
19,572 | A multiagent urban traffic simulation. Part II: dealing with the
extraordinary | cs.AI | In Probabilistic Risk Management, risk is characterized by two quantities:
the magnitude (or severity) of the adverse consequences that can potentially
result from the given activity or action, and by the likelihood of occurrence
of the given adverse consequences. But a risk seldom exists in isolation: chain
of consequ... | computer science |
19,573 | A Local Search Modeling for Constrained Optimum Paths Problems (Extended
Abstract) | cs.AI | Constrained Optimum Path (COP) problems appear in many real-life
applications, especially on communication networks. Some of these problems have
been considered and solved by specific techniques which are usually difficult
to extend. In this paper, we introduce a novel local search modeling for
solving some COPs by loc... | computer science |
19,574 | Dynamic Demand-Capacity Balancing for Air Traffic Management Using
Constraint-Based Local Search: First Results | cs.AI | Using constraint-based local search, we effectively model and efficiently
solve the problem of balancing the traffic demands on portions of the European
airspace while ensuring that their capacity constraints are satisfied. The
traffic demand of a portion of airspace is the hourly number of flights planned
to enter it,... | computer science |
19,575 | On Improving Local Search for Unsatisfiability | cs.AI | Stochastic local search (SLS) has been an active field of research in the
last few years, with new techniques and procedures being developed at an
astonishing rate. SLS has been traditionally associated with satisfiability
solving, that is, finding a solution for a given problem instance, as its
intrinsic nature does n... | computer science |
19,576 | Integrating Conflict Driven Clause Learning to Local Search | cs.AI | This article introduces SatHyS (SAT HYbrid Solver), a novel hybrid approach
for propositional satisfiability. It combines local search and conflict driven
clause learning (CDCL) scheme. Each time the local search part reaches a local
minimum, the CDCL is launched. For SAT problems it behaves like a tabu list,
whereas f... | computer science |
19,577 | A Constraint-directed Local Search Approach to Nurse Rostering Problems | cs.AI | In this paper, we investigate the hybridization of constraint programming and
local search techniques within a large neighbourhood search scheme for solving
highly constrained nurse rostering problems. As identified by the research, a
crucial part of the large neighbourhood search is the selection of the fragment
(neig... | computer science |
19,578 | Sonet Network Design Problems | cs.AI | This paper presents a new method and a constraint-based objective function to
solve two problems related to the design of optical telecommunication networks,
namely the Synchronous Optical Network Ring Assignment Problem (SRAP) and the
Intra-ring Synchronous Optical Network Design Problem (IDP). These network
topology ... | computer science |
19,579 | Parallel local search for solving Constraint Problems on the Cell
Broadband Engine (Preliminary Results) | cs.AI | We explore the use of the Cell Broadband Engine (Cell/BE for short) for
combinatorial optimization applications: we present a parallel version of a
constraint-based local search algorithm that has been implemented on a
multiprocessor BladeCenter machine with twin Cell/BE processors (total of 16
SPUs per blade). This al... | computer science |
19,580 | Toward an automaton Constraint for Local Search | cs.AI | We explore the idea of using finite automata to implement new constraints for
local search (this is already a successful technique in constraint-based global
search). We show how it is possible to maintain incrementally the violations of
a constraint and its decision variables from an automaton that describes a
ground ... | computer science |
19,581 | Proceedings 6th International Workshop on Local Search Techniques in
Constraint Satisfaction | cs.AI | LSCS is a satellite workshop of the international conference on principles
and practice of Constraint Programming (CP), since 2004. It is devoted to local
search techniques in constraint satisfaction, and focuses on all aspects of
local search techniques, including: design and implementation of new
algorithms, hybrid s... | computer science |
19,582 | Tracking object's type changes with fuzzy based fusion rule | cs.AI | In this paper the behavior of three combinational rules for
temporal/sequential attribute data fusion for target type estimation are
analyzed. The comparative analysis is based on: Dempster's fusion rule proposed
in Dempster-Shafer Theory; Proportional Conflict Redistribution rule no. 5
(PCR5), proposed in Dezert-Smara... | computer science |
19,583 | Finite element model selection using Particle Swarm Optimization | cs.AI | This paper proposes the application of particle swarm optimization (PSO) to
the problem of finite element model (FEM) selection. This problem arises when a
choice of the best model for a system has to be made from set of competing
models, each developed a priori from engineering judgment. PSO is a
population-based stoc... | computer science |
19,584 | A Fuzzy Petri Nets Model for Computing With Words | cs.AI | Motivated by Zadeh's paradigm of computing with words rather than numbers,
several formal models of computing with words have recently been proposed.
These models are based on automata and thus are not well-suited for concurrent
computing. In this paper, we incorporate the well-known model of concurrent
computing, Petr... | computer science |
19,585 | On a Model for Integrated Information | cs.AI | In this paper we give a thorough presentation of a model proposed by Tononi
et al. for modeling \emph{integrated information}, i.e. how much information is
generated in a system transitioning from one state to the next one by the
causal interaction of its parts and \emph{above and beyond} the information
given by the s... | computer science |
19,586 | Graph Quantization | cs.AI | Vector quantization(VQ) is a lossy data compression technique from signal
processing, which is restricted to feature vectors and therefore inapplicable
for combinatorial structures. This contribution presents a theoretical
foundation of graph quantization (GQ) that extends VQ to the domain of
attributed graphs. We pres... | computer science |
19,587 | Decisional Processes with Boolean Neural Network: the Emergence of
Mental Schemes | cs.AI | Human decisional processes result from the employment of selected quantities
of relevant information, generally synthesized from environmental incoming data
and stored memories. Their main goal is the production of an appropriate and
adaptive response to a cognitive or behavioral task. Different strategies of
response ... | computer science |
19,588 | Web-Based Expert System for Civil Service Regulations: RCSES | cs.AI | Internet and expert systems have offered new ways of sharing and distributing
knowledge, but there is a lack of researches in the area of web based expert
systems. This paper introduces a development of a web-based expert system for
the regulations of civil service in the Kingdom of Saudi Arabia named as RCSES.
It is t... | computer science |
19,589 | Application of a Fuzzy Programming Technique to Production Planning in
the Textile Industry | cs.AI | Many engineering optimization problems can be considered as linear
programming problems where all or some of the parameters involved are
linguistic in nature. These can only be quantified using fuzzy sets. The aim of
this paper is to solve a fuzzy linear programming problem in which the
parameters involved are fuzzy qu... | computer science |
19,590 | The Application of Mamdani Fuzzy Model for Auto Zoom Function of a
Digital Camera | cs.AI | Mamdani Fuzzy Model is an important technique in Computational Intelligence
(CI) study. This paper presents an implementation of a supervised learning
method based on membership function training in the context of Mamdani fuzzy
models. Specifically, auto zoom function of a digital camera is modelled using
Mamdani techn... | computer science |
19,591 | Steepest Ascent Hill Climbing For A Mathematical Problem | cs.AI | The paper proposes artificial intelligence technique called hill climbing to
find numerical solutions of Diophantine Equations. Such equations are important
as they have many applications in fields like public key cryptography, integer
factorization, algebraic curves, projective curves and data dependency in super
comp... | computer science |
19,592 | Hierarchical Multiclass Decompositions with Application to Authorship
Determination | cs.AI | This paper is mainly concerned with the question of how to decompose
multiclass classification problems into binary subproblems. We extend known
Jensen-Shannon bounds on the Bayes risk of binary problems to hierarchical
multiclass problems and use these bounds to develop a heuristic procedure for
constructing hierarchi... | computer science |
19,593 | Introduction to the iDian | cs.AI | The iDian (previously named as the Operation Agent System) is a framework
designed to enable computer users to operate software in natural language.
Distinct from current speech-recognition systems, our solution supports
format-free combinations of orders, and is open to both developers and
customers. We used a multi-l... | computer science |
19,594 | A Protocol for Self-Synchronized Duty-Cycling in Sensor Networks:
Generic Implementation in Wiselib | cs.AI | In this work we present a protocol for self-synchronized duty-cycling in
wireless sensor networks with energy harvesting capabilities. The protocol is
implemented in Wiselib, a library of generic algorithms for sensor networks.
Simulations are conducted with the sensor network simulator Shawn. They are
based on the spe... | computer science |
19,595 | New S-norm and T-norm Operators for Active Learning Method | cs.AI | Active Learning Method (ALM) is a soft computing method used for modeling and
control based on fuzzy logic. All operators defined for fuzzy sets must serve
as either fuzzy S-norm or fuzzy T-norm. Despite being a powerful modeling
method, ALM does not possess operators which serve as S-norms and T-norms which
deprive it... | computer science |
19,596 | A Partial Taxonomy of Substitutability and Interchangeability | cs.AI | Substitutability, interchangeability and related concepts in Constraint
Programming were introduced approximately twenty years ago and have given rise
to considerable subsequent research. We survey this work, classify, and relate
the different concepts, and indicate directions for future work, in particular
with respec... | computer science |
19,597 | Learning under Concept Drift: an Overview | cs.AI | Concept drift refers to a non stationary learning problem over time. The
training and the application data often mismatch in real life problems. In this
report we present a context of concept drift problem 1. We focus on the issues
relevant to adaptive training set formation. We present the framework and
terminology, a... | computer science |
19,598 | A Unifying Probabilistic Perspective for Spectral Dimensionality
Reduction: Insights and New Models | cs.AI | We introduce a new perspective on spectral dimensionality reduction which
views these methods as Gaussian Markov random fields (GRFs). Our unifying
perspective is based on the maximum entropy principle which is in turn inspired
by maximum variance unfolding. The resulting model, which we call maximum
entropy unfolding ... | computer science |
19,599 | Translation-Invariant Representation for Cumulative Foot Pressure Images | cs.AI | Human can be distinguished by different limb movements and unique ground
reaction force. Cumulative foot pressure image is a 2-D cumulative ground
reaction force during one gait cycle. Although it contains pressure spatial
distribution information and pressure temporal distribution information, it
suffers from several ... | computer science |
19,600 | Planning with Partial Preference Models | cs.AI | Current work in planning with preferences assume that the user's preference
models are completely specified and aim to search for a single solution plan.
In many real-world planning scenarios, however, the user probably cannot
provide any information about her desired plans, or in some cases can only
express partial pr... | computer science |
19,601 | Extracting Features from Ratings: The Role of Factor Models | cs.AI | Performing effective preference-based data retrieval requires detailed and
preferentially meaningful structurized information about the current user as
well as the items under consideration. A common problem is that representations
of items often only consist of mere technical attributes, which do not resemble
human pe... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.