Sebanyak 2511 item atau buku ditemukan

Randomization Methods in Algorithm Design

DIMACS Workshop, December 12-14, 1997

Geometrical understanding of the Constant Modulus Algorithm

adaptive blind equalization and cross-polarized source separation

Field-Programmable Logic: Architectures, Synthesis and Applications

4th International Workshop on Field-Programmable Logic and Applications, FPL'94, Prague, Czech Republic, September 7 - 9, 1994. Proceedings

This volume contains the proceedings of the 4th International Workshop on Field-Programmable Logic and Applications (FPL '94), held in Prague, Czech Republic in September 1994. The growing importance of field-programmable devices is substantiated by the remarkably high number of 116 submissions for FPL '94; from them, the revised versions of 40 full papers and 24 high-quality poster presentations were accepted for inclusion in this volume. Among the topics treated are: testing, layout, synthesis tools, compilation research and CAD, trade-offs and experience, innovations and smart applications, FPGA-based computer architectures, high-level design, prototyping and ASIC emulators, commercial devices, new tools, CCMs and HW/SW co-design, modelers, educational experience, and novel architectures.

A special purpose processor originally designed for Monte-Carlo simulation
using Metropolis type algorithms has been reconfigured to allow the use of a new
improved class of Monte-Carlo algorithm without compromising the processor's
performance. 1 Introduction In Monte-Carlo simulations and digital signal
processing applications it has often proved advantageous to use specially
constructed processors in place of general purpose computers. SRAM-bascd
Field Programmable ...

Field-Programmable Logic and Applications

13th International Conference, FPL 2003, Lisbon, Portugal, September 1-3, 2003, Proceedings

This book constitutes the refereed proceedings of the 13th International Conference on Field-Programmable Logic and Applications, FPL 2003, held in Lisbon, Portugal in September 2003. The 90 revised full papers and 56 revised poster papers presented were carefully reviewed and selected from 216 submissions. The papers are organized in topical sections on technologies and trends, communications applications, high level design tools, reconfigurable architecture, cryptographic applications, multi-context FPGAs, low-power issues, run-time reconfiguration, compilation tools, asynchronous techniques, bio-related applications, codesign, reconfigurable fabrics, image processing applications, SAT techniques, application-specific architectures, DSP applications, dynamic reconfiguration, SoC architectures, emulation, cache design, arithmetic, bio-inspired design, SoC design, cellular applications, fault analysis, and network applications.

13th International Conference, FPL 2003, Lisbon, Portugal, September 1-3, 2003,
Proceedings Peter Y.K. Cheung, Georg A. Constantinides Jose T. de Sousa. An
Algorithm Designer's Workbench for Platform FPGAs⋆ Sumit Mohanty and Viktor
K. Prasanna Electrical Engineering Systems, University of Southern California,
CA, USA, {smohanty ...

Field Programmable Logic and Application

14th International Conference , FPL 2004, Leuven, Belgium, August 30-September 1, 2004, Proceedings

This book constitutes the refereed proceedings of the 14th International Conference on Field-Programmable Logic, FPL 2003, held in Leuven, Belgium in August/September 2004. presented together with 3 keynote contributions and 3 tutorial summaries were carefully reviewed and selected from 285 papers submitted. computing, security and cryptography, platform-based design, algorithms and architectures, acceleration application, architecture, physical design, arithmetic, multitasking, circuit technology, network processing, testing, applications, signal processing, computational models and compiler, dynamic reconfiguration, networks and optimisation algorithms, system-on-chip, high-speed design, image processing, network-on-chip, power-aware design, IP-based design, co-processing architectures, system level design, physical interconnect, computational models, cryptography and compression, network applications and architecture, and debugging and teSt.

14th International Conference , FPL 2004, Leuven, Belgium, August 30-
September 1, 2004, Proceedings Jürgen Becker, Marco Platzner Serge Vernalde
. Execution Speed of the Pattern Recognition Algorithm for ATLAS – High Energy
Physics Experiment Christian Hinkelbein, Andrei Khomich, Andreas Kugel,
Reinhard Männer, and Matthias Müller Institute of Computer Science V,
University of Mannheim, B6, 23-29, 68131, Mannheim, Germany {hinkelbein,
khomich, kugel, maenner, ...

Logic at Botik '89

Symposium on Logical Foundations of Computer Science, Pereslavl-Zalessky, USSR, July 3-8, 1989, Proceedings

The present volume contains the proceedings of Logic at Botik '89, a symposium on logical foundations of computer science organized by the Program Systems Institute of the USSR Academy of Sciences and held at Pereslavl-Zalessky, USSR, July 3-8, 1989. The scope of the symposium was very broad; the topics of interest were: complexity of formal systems, constructive mathematics in computer science, denotational and operational semantics of programs, descriptive complexity, dynamic and algorithmic logics and schematology, formal tools to describe concurrent computations, lambda calculus and related topics, foundations of logic programming, logical foundations of database theory, logics for knowledge representation, modal and temporal logics, type theory in programming, and verification of programs. Thus, the papers in this volume represent many interesting trends in logical foundations of Computer Science, ranging from purely theoretical research to practical applications of theory.

Symposium on Logical Foundations of Computer Science, Pereslavl-Zalessky,
USSR, July 3-8, 1989, Proceedings Albert R. Meyer, Michael A. Taitslin. A
mathematical modeling of pure, recursive algorithms Yiannis. N. Moschovakis*
Department of Mathematics, UCLA ...

Inductive Logic Programming

18th International Conference, ILP 2008 Prague, Czech Republic, September 10-12, 2008, Proceedings

This book constitutes the refereed proceedings of the 18th International Conference on Inductive Logic Programming, ILP 2008, held in Prague, Czech Republic, in September 2008. The 20 revised full papers presented together with the abstracts of 5 invited lectures were carefully reviewed and selected during two rounds of reviewing and improvement from 46 initial submissions. All current topics in inductive logic programming are covered, ranging from theoretical and methodological issues to advanced applications. The papers present original results in the first-order logic representation framework, explore novel logic induction frameworks, and address also new areas such as statistical relational learning, graph mining, or the semantic Web.

This can lead to subop- timal results given prediction tasks. On the other hand
better results in prediction problems have been achieved by discriminative
learning of MLNs weights given a certain structure. In this paper we propose an
algorithm for learning the structure of MLNs discriminatively by max- imimizing
the conditional likelihood of the query predicates instead of the joint likelihood of
all predicates. The algorithm chooses the structures by maximizing conditional
likelihood and ...

Logic Programming '87

Proceedings of the 6th Conference Tokyo, Japan, June 22-24, 1987

This volume contains most of the papers presented at the 6th Logic Programming Conference held in Tokyo, June 22-24, 1987. It is the successor of Lecture Notes in Computer Science volumes 221 and 264. The contents cover foundations, programming, architecture and applications. Topics of particular interest are constraint logic programming and parallelism. The effort to apply logic programming to large-scale realistic problems is another important subject of these proceedings.

CHASSIS, FUJITSU LIMITED 140, Miyamoto, Numazu, Shizuoka 410-03, Japan
ABSTRACT This paper is concerned with an algorithm for identifying an unknown
regular language from examples of its members and non-members. The
algorithm is based on the model inference algorithm given by Shapiro. In our
setting, however, a given first order language for describing a target logic
program has countably many unary predicate symbols: qo, qi, q%, . . .. On the
other hand, the oracle ...

Progress in Artificial Intelligence. Knowledge Extraction, Multi-agent Systems, Logic Programming, and Constraint Solving

10th Portuguese Conference on Artificial Intelligence, EPIA 2001, Porto, Portugal, December 17-20, 2001. Proceedings

This book constitutes the refereed proceedings of the 10th Portuguese Conference on Artificial Intelligence, EPTA 2001, held in Porto, Portugal, in December 2001. The 21 revised long papers and 18 revised short papers were carefully reviewed and selected from a total of 88 submissions. The papers are organized in topical sections on extraction of knowledge from databases, AI techniques for financial time series analysis, multi-agent systems, AI logics and logic programming, constraint satisfaction, and AI planning.

This paper proposes a stochastic, and complete, backtrack search algorithm for
Propositional Satisfiability (SAT). In recent years, randomization has become
pervasive in SAT algorithms. Incomplete algorithms for SAT, for example the
ones based on local search, often re- sort to randomization. Complete algorithms
also resort to randomization. These include, state-of-the-art backtrack search SAT
algorithms that often randomize variable selection heuristics. Moreover, it is plain
that the ...

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 ...