Sebanyak 375 item atau buku ditemukan

Foundations of Fuzzy Logic and Soft Computing

12th International Fuzzy Systems Association World Congress, IFSA 2007, Cancun, Mexico, Junw 18-21, 2007, Proceedings

Annotation This book comprises a selection of papers from IFSA 2007 on new methods and theories that contribute to the foundations of fuzzy logic and soft computing. These papers were selected from over 400 submissions and constitute an important contribution to the theory and applications of fuzzy logic and soft computing methodologies. Soft Computing consists of several computing paradigms, including fuzzy logic, neural networks, genetic algorithms, and other techniques, which can be used to produce powerful intelligent systems for solving real-world problems. This book is intended to be a major reference for scientists and engineers interested in applying new computational and mathematical tools to achieve intelligent solution to complex problems. We consider that this book can also be used to get novel ideas for new lines of research, or to continue the lines of research proposed by the authors of the papers contained in the book. The 80 papers presented were carefully reviewed and selected form more than 400 submissions. The papers are organized in topical sections on relation between interval and fuzzy techniques, intuitionistic fuzzy sets and their applications, the application of fuzzy logic and soft computing in flexible querying, philosophical and human-scientific aspects of soft computing, search engine and information processing and retrieval, perception based data mining and decision making, joint model-based and data-based learning: the fuzzy logic approach, fuzzy possibilistic optimization, fuzzy trees, fuzzy logic theory, type-2 fuzzy logic, fuzzy logic applications, neural networks and control, as well as intelligent agents and knowledge ant colony.

12th International Fuzzy Systems Association World Congress, IFSA 2007,
Cancun, Mexico, Junw 18-21, 2007, Proceedings Patricia Melin. A Cultural
Algorithm with Operator Parameters Control for Solving Timetabling Problems⋆
Carlos Soza1, Ricardo Landa2, Mar ́ıa Cristina Riff1, and Carlos Coello2 1
Universidad Federico Santa Mar ́ıa, Departamento de Informática Av. Espa ̃na No
. 1680, Valpara ́ıso, Chile {csoza ...

The Logic of Logistics

Theory, Algorithms, and Applications for Logistics Management

Fierce competition in today's global market provides a powerful motivation for developing ever more sophisticated logistics systems. This book, written for the logistics manager and researcher, presents a survey of the modern theory and application of logistics. The goal of the book is to present the state-of-the-art in the science of logistics management. As a result, the authors have written a timely and authoritative survey of this field that many practitioners and researchers will find makes an invaluable companion to their work.

2 2.1 Examples of convex sets and nonconvex sets . . . . . . . . . . . . 16 2.2
Illustration of the definition of convex function . . . . . . . . . . . 17 2.3 Illustration of the
definition of subgradient . . . . . . . . . . . . . 22 4.1 An example for the minimum
spanning tree-based algorithm with n =18 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75
4.2 An example for the nearest-insertion algorithm with n =8 . . . . 78 4.3 The
matching and the optimal traveling salesman tour . . . . . . 79 4.4 An example for
Christofides' algorithm ...

Artificial Intelligence in Logic Design

There are three outstanding points of this book. First: for the first time, a collective point of view on the role of artificial intelligence paradigm in logic design is introduced. Second, the book reveals new horizons of logic design tools on the technologies of the near future. Finally, the contributors of the book are twenty recognizable leaders in the field from the seven research centres. The chapters of the book have been carefully reviewed by equally qualified experts. All contributors are experienced in practical electronic design and in teaching engineering courses. Thus, the book's style is accessible to graduate students, practical engineers and researchers.

from Mishchenko's and our algorithms confirmed the above observation. The
decision diagram based exact algorithms are also inefficient for larger difficult
problem instances (e.g. for benchmarks “Flag” and “Mashroom” having 28 and 22
inputs, correspondingly (Mishchenko et al. 2000)). 5.2. QuickScan Inefficiency of
exact algorithms for larger instances of MISP motivates the development of faster
heuristic algorithms. Although the heuristic algorithms cannot guarantee the
optimal ...

Inductive Logic Programming

10th International Conference, ILP 2000, London, UK, July 24-27, 2000 Proceedings

Shan-HweiNienhuys-Cheng(UniversityofRotterdam,Netherlands) WilliamCohen(WhizbangsLabs,USA) LucDeRaedt(UniversityofFreiburg,Germany) Sa?soD?zeroski(Jo?zefStefanInstitute,Ljubljana) PeterFlach(UniversityofBristol,UK) AlanFrisch(UniversityofYork,UK) KoichiFurukawa(UniversityofKeio,Japan) RoniKhardon(UniversityofEdinburgh,UK) J¨org-UweKietz(SwissLife,Switzerland) NadaLavra?c(Jo?zefStefanInstitute,Slovenia) JohnLloyd(AustralianNationalUniversity,Australia) StanMatwin(UniversityofOttawa,Canada) RaymondMooney(UniversityofTexas,USA) StephenMuggleton(UniversityofYork,UK) DavidPage(UniversityofWisconsin,USA) BernhardPfahringer(UniversityofWaikato,NewZealand) C´elineRouveirol(Universit´edeParis-Sud,France) ClaudeSammut(UniversityofNewSouthWales,Australia) ´ Mich`eleSebag(EcolePolytechnique,France) AshwinSrinivasan(UniversityofOxford,UK) PrasadTadepalli(OregonStateUniversity,USA) StefanWrobel(UniversityofMagdeburg,Germany) AkihiroYamamoto(UniversityofHokkaido,Japan) Additional Referees ´ ErickAlphonse(Universit´edeParis-Sud,France) LiviuBadea(NationalInstituteforResearchandDevelopmentinInformatics, Romania) DamjanDemsar(Jo?zefStefanInstitute,Slovenia) ElisabethGoncalves(Universit´edeParis-Sud,France) MarkoGrobelnik(Jo?zefStefanInstitute,Slovenia) ClaireKennedy(UniversityofBristol,UK) DanielKudenko(UniversityofYork,UK) JohanneMorin(UniversityofOttawa,Canada) TomonobuOzaki(KeioUniversity,Japan) EdwardRoss(UniversityofBristol,UK) LjupcoTodorovski(Jo?zefStefanInstitute,Slovenia) V´eroniqueVentos(Universit´edeParis-Sud,France) VIII ProgramCommitteeandReferees Sponsors of ILP2000 ILPNet2,TheEuropeanNetworkofExcellenceinInductiveLogicProgramming MLNet,TheEuropeanNetworkofExcellenceinMachineLearning CompulogNet,TheEuropeanNetworkofExcellenceinComputationalLogic Table of Contents IInvitedPaper ILP:JustDoIt. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 DavidPage II Contributed Papers ANewAlgorithmforLearningRangeRestrictedHornExpressions. . . . . . . 21 MartaArias,RoniKhardon ARe?nementOperatorforDescriptionLogics. . . . . . . . . . . . . . . . . . . . . . . . . 40 LiviuBadea,Shan-HweiNienhuys-Cheng ExecutingQueryPacksinILP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60 HendrikBlockeel,LucDehaspe,BartDemoen,GerdaJanssens, JanRamon,HenkVandecasteele ALogicalDatabaseMiningQueryLanguage . . . . . . . . . . . . . . . . . . . . . . . . . . 78 LucDeRaedt Induction of Recursive Theories in the Normal ILP Setting: Issues and Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93 FlorianaEsposito,DonatoMalerba,FrancescaA. Lisi ExtendingK-MeansClusteringtoFirst-OrderRepresentations. . . . . . . . . . . 112 MathiasKirsten,StefanWrobel TheoryCompletionUsingInverseEntailment . . . . . . . . . . . . . . . . . . . . . . . . . . 130 StephenH. Muggleton,ChristopherH. Bryant SolvingSelectionProblemsUsingPreferenceRelationBasedonBayesian Learning. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 147 TomofumiNakano,NobuhiroInuzuka ConcurrentExecutionofOptimalHypothesisSearchforInverse Entailment. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 165 HayatoOhwada,HiroyukiNishiyama,FumioMizoguchi UsingILPtoImprovePlanninginHierarchicalReinforcementLearning. . . 174 MarkReid,MalcolmRyan X TableofContents TowardsLearninginCARIN-ALN. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 191 C´elineRouveirol,V´eroniqueVentos InverseEntailmentinNonmonotonicLogicPrograms. . . . . . . . . . . . . . . . . . . 209 ChiakiSakama ANoteonTwoSimpleTransformationsforImprovingtheE?ciencyofan ILPSystem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 225 V´?torSantosCosta,AshwinSrinivasan,RuiCamacho SearchingtheSubsumptionLattic

10th International Conference, ILP 2000, London, UK, July 24-27, 2000
Proceedings James Cussens, Alan Frisch. A New Algorithm for Learning Range
Restricted Horn Expressions⋆ (Extended Abstract) Marta Arias and Roni
Khardon Division of Informatics, University of Edinburgh The King's Buildings,
Edinburgh EH9 3JZ, Scotland {marta ...

Functional and Constraint Logic Programming

18th International Workshop, WFLP 2009, Brasilia, Brazil, June 28, 2009, Revised Selected Papers

This book constitutes the thoroughly refereed post-conference proceedings of the 18th International Workshop on Functional and Constraint Logic Programming, WFLP 2009, held in Brasilia, Brazil, in June 2009 as part of RDP 2009, the Federated Conference on Rewriting, Deduction, and Programming. The 9 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 14 initial workshop contributions. The papers cover current research in all areas of functional and constraint logic programming including typical areas of interest, such as foundational issues, language design, implementation, transformation and analysis, software engineering, integration of paradigms, and applications.

This paper presents a taxonomy of some exact, right-to-left, string-matching
algorithms. The taxonomy is based on results obtained by using logic program
transformation over a naive and nondeterministic specification. A derivation of the
search part and some notes about the preprocessing part of each algorithm is
presented. The derivations show several design decisions behind each algorithm
, and allow us to organize the algorithms within a taxonomic tree, giving us a
better ...

Field-Programmable Logic and Applications

5th International Workshop, FPL '95, Oxford, United Kingdom, August 29 - September 1, 1995. Proceedings

This volume constitutes the proceedings of the Fifth International Workshop on Field-Programmable Logic and Its Applications, FPL '95, held in Oxford, UK in August/September 1995. The volume presents 46 full revised papers carefully selected by the program committee from a large number and wide range of submissions. The papers document the progress achieved since the predecessor conference (see LNCS 849). They are organized in sections on architectures, platforms, tools, arithmetic and signal processing, embedded systems and other applications, and reconfigurable design and models.

The REDOC III algorithm for data ciphering is a potential replacement for DES.
This paper looks at ways of customising the algorithm to increase security without
reducing ciphering speed. Many valuable modifications are possible if
reconfigurable hardware is used.

Logic and Theory of Algorithms

4th Conference on Computability in Europe, CiE 2008 Athens, Greece, June 15-20, 2008, Proceedings

This book constitutes the refereed proceedings of the 4th International Conference on Computability in Europe, CiE 2008, held in Athens, Greece, in June 2008. The 36 revised full papers presented together with 25 invited tutorials and lectures were carefully reviewed and selected from 108 submissions. Among them are papers of 6 special sessions entitled algorithms in the history of mathematics, formalising mathematics and extracting algorithms from proofs, higher-type recursion and applications, algorithmic game theory, quantum algorithms and complexity, and biology and computation.

We study the satisfiability problem for LTLACK and related decidability problem.
The key result is an algorithm which recognizes theorems of LTLACK (so we
show that LTLACK is decidable), which, as a consequence, also solves the
satisfiability problem. Technique is based on verification of validity for special
normal reduced forms of rules in models of double exponential in the size of rules
. Keywords: linear temporal logic, multi-agent logics,hybrid logics, re- lational
Kripke-Hintikka ...

Logic Program Synthesis from Incomplete Information

Program synthesis is a solution to the software crisis. If we had a program that develops correct programs from specifications, then program validation and maintenance would disappear from the software life-cycle, and one could focus on the more creative tasks of specification elaboration, validation, and maintenance, because replay of program development would be less costly. This monograph describes a novel approach to Inductive Logic Programming (ILP), which cross-fertilizes logic programming and machine learning. Aiming at the synthesis of recursive logic programs only, and this from incomplete information, we take a software engineering approach that is more appropriate than a pure artificial intelligence approach. This book is suitable as a secondary text for graduate level courses in software engineering and artificial intelligence, and as a reference for practitioners of program synthesis.

Logic Algorithm 4-1: Logic Algorithm 4-2. Logic Algorithm 4-3: Logic Algorithm 5-
1: Logic Algorithm 5-2. Logic Algorithm 5-3: Logic Algorithm 5-4: Logic Algorithm
5-5: Logic Algorithm 5-6. Logic Algorithm 5-7: Logic Algorithm 5-8: Logic
Algorithm 5-9: Logic Algorithm 5-10: Logic Algorithm 5-11: Logic Algorithm 5-12:
Logic Algorithm 5-13: Logic Algorithm 5-14: Logic Algorithm 5-15: Logic
Algorithm 5-16: Logic Algorithm 5-17: Logic Algorithm 5-18: Logic Algorithm 5-19:
Logic Algorithm ...

Logic Minimization Algorithms for VLSI Synthesis

The roots of the project which culminates with the writing of this book can be traced to the work on logic synthesis started in 1979 at the IBM Watson Research Center and at University of California, Berkeley. During the preliminary phases of these projects, the impor tance of logic minimization for the synthesis of area and performance effective circuits clearly emerged. In 1980, Richard Newton stirred our interest by pointing out new heuristic algorithms for two-level logic minimization and the potential for improving upon existing approaches. In the summer of 1981, the authors organized and participated in a seminar on logic manipulation at IBM Research. One of the goals of the seminar was to study the literature on logic minimization and to look at heuristic algorithms from a fundamental and comparative point of view. The fruits of this investigation were surprisingly abundant: it was apparent from an initial implementation of recursive logic minimiza tion (ESPRESSO-I) that, if we merged our new results into a two-level minimization program, an important step forward in automatic logic synthesis could result. ESPRESSO-II was born and an APL implemen tation was created in the summer of 1982. The results of preliminary tests on a fairly large set of industrial examples were good enough to justify the publication of our algorithms. It is hoped that the strength and speed of our minimizer warrant its Italian name, which denotes both express delivery and a specially-brewed black coffee.

The proof (omitted) follows from the fact that each cube of F must be orthogonal to
all the cubes of F. This translates directly into the statement that each row of M is
a column cover of M. 3.6 Simplify We now illustrate the use of the unate recursive
paradigm to construct a heuristic minimization algorithm, SIMPLIFY. Even though
this is not one of the algorithms of ESPRESSO-II, we discuss it for illustrative
purposes, and also because it has proven to be an extremely valuable algorithm
in ...

Fuzzy Logic-Based Algorithms for Video De-Interlacing

The ‘Fuzzy Logic’ research group of the Microelectronics Institute of Seville is composed of researchers who have been doing research on fuzzy logic since the beginning of the 1990s. Mainly, this research has been focused on the microel- tronic design of fuzzy logic-based systems using implementation techniques which range from ASICs to FPGAs and DSPs. Another active line was the development of a CAD environment, named Xfuzzy, to ease such design. Several versions of Xfuzzy have been and are being currently developed by the group. The addressed applications had basically belonged to the control ?eld domain. In this sense, s- eral problems without a linear control solution had been studied thoroughly. Some examples are the navigation control of an autonomous mobile robot and the level control of a dosage system. The research group tackles a new activity with the work developed in this book: the application of fuzzy logic to video and image processing. We addressed our interest to problems related to pixel interpolation, with the aim of adapting such interpolation to the local features of the images. Our hypothesis was that measures and decisions to solve image interpolation, which traditionally had been done in a crisp way, could better be done in a fuzzy way. Validation of this general hypothesis has been done speci?cally in the interpolation problem of video de-interlacing. - interlacing is one of the main tasks in video processing.

Algorithm. for. Video. De-Interlacing. Abstract. The ability of fuzzy logic-based
systems for video de-interlacing is ex- plored in this Chapter. Particularly, our
study is focused on how motion-adaptive de-interlacing can be performed by a
fuzzy logic-based system. This Chapter is structured as follows. Firstly, several
motion-adaptive strategies are described in Section 2.1. The starting point of our
study is the algorithm developed by Van de Ville et al. in [6] described in Section
2.2.