the proceedings contain 28 papers. the special focus in this conference is on Algorithmic Learning theory. the topics include: Learnability of exclusive-or expansion based on monotone DNF formulas;improved bounds abou...
ISBN:
(纸本)3540618635
the proceedings contain 28 papers. the special focus in this conference is on Algorithmic Learning theory. the topics include: Learnability of exclusive-or expansion based on monotone DNF formulas;improved bounds about on-line learning of smooth functions of a single variable;query learning of bounded-width OBDDs;learning a representation for optimizable formulas;limits of exact algorithms for inference of minimum size finite state machines;minimum message length segmentation;reducing complexity of decision trees with two variable tests;the complexity of exactly learning algebraic concepts;efficient learning of real time two-counter automata;cost-sensitive feature reduction applied to a hybrid genetic algorithm;incorporating hypothetical knowledge into the process of inductive synthesis;induction of constraint logic programs;constructive learning of translations based on dictionaries;inductive logic programming beyond logical implication;noise elimination in inductive concept learning;MML estimation of the parameters of the spherical fisher distribution;learning by erasing;on learning and co-learning of minimal programs;a class of prolog programs inferable from positive data;vacillatory and BC learning on noisy data;transformations that preserve learnability and reflecting inductive inference machines and its improvement by therapy.
the proceedings contain 35 papers. the special focus in this conference is on Design and Implementation of Symbolic Computation systems. the topics include: Problem-oriented applications of automated theorem proving;a...
ISBN:
(纸本)3540616977
the proceedings contain 35 papers. the special focus in this conference is on Design and Implementation of Symbolic Computation systems. the topics include: Problem-oriented applications of automated theorem proving;a strongly-typed embeddable computer algebra library;a general framework for implementing calculi and strategies;equality elimination for the tableau method;towards lean proof checking;high performance equational theorem proving;a reflective language based on conditional term rewriting;term rewriting systems;generative geometric modeling in a functional environment;exploiting SML for experimenting with algebraic algorithms;conditional categories and domains;parameterizing object specifications;analyzing the dynamics of a Z specification;integer and rational arithmetic on maspar;parallel 3-primes FFT algorithm;a master-slave approach to parallel term rewriting on a hierarchical multiprocessor;concepts and applications;document-centered presentation of computing software;animating a non-executable formal specification with a distributed symbolic language;uniform representation of basic algebraic structures in computer algebra;integrating computer algebra with proof planning;structures for symbolic mathematical reasoning and computation;an approach to class reasoning in symbolic computation;an intelligent interface to numerical routines;computer algebra and the world wide web;software architectures for computer algebra;a deductive database for mathematical formulas;a system for computer aided constructive algebraic geometry;making systems communicate and cooperate;a database for number fields;compiling residuation for a multiparadigm symbolic programming language and pluggability issues in the multi protocol.
We present a new algorithm for detecting generalized deadlocks in distributed systems. Our algorithm incrementally constructs and reduces a wait-for graph (WFG) at an initiator process. this WFG is then searched for d...
详细信息
We present a new algorithm for detecting generalized deadlocks in distributed systems. Our algorithm incrementally constructs and reduces a wait-for graph (WFG) at an initiator process. this WFG is then searched for deadlock. the proposed algorithm has two primary advantages: First, it avoids sending messages along the edges of the global wait-for graph (WFG), thereby achieving a worst-case message complexity of 2n, where n is the number of processes in the WFG. Since information must be obtained from every process reachable from the initiator, this is optimal to within a constant factor. All the existing algorithms for the same problem construct a distributed snapshot of the WFG. As this involves sending messages along the edges of the WFG, the best available message complexity among these algorithms is 4e-2n+2l, which is O(n/sup 2/) in the worst case, where e and l are the number of edges and leaves in the WFG, respectively. Second, since the information about a detected deadlock is readily available at the initiator process, rather than distributed among different processes, it significantly simplifies the task of deadlock resolution, and helps to reduce system overhead associated withthe resolution. the time complexity of our algorithm is also better than or equal to the existing algorithms.
the proceedings contain 63 papers. the special focus in this conference is on Knowledge Representation, Learning and Discovery systems. the topics include: Learning composite concepts in description logics;comparison ...
ISBN:
(纸本)9783540612865
the proceedings contain 63 papers. the special focus in this conference is on Knowledge Representation, Learning and Discovery systems. the topics include: Learning composite concepts in description logics;comparison of conceptual graphs for modeling knowledge of multiple experts;semantical considerations for knowledge base updates;partial evaluation in constraint logic programming;the AQI 7-DCI system for data-driven constructive induction and its application to the analysis of world economics;induction of classification rules from imperfect data;induction of expert system rules from databases based on rough set theory and resampling methods;mining patterns at each scale in massive data;on evolving intelligence;intelligent mutation rate control in canonical genetic algorithms;a fine-grained parallel evolutionary program for concept induction;evolutionary exploration of search spaces;evolutionary computation;signed formula logic programming;automating proofs of integrity constraints in situation calculus;towards programming in default logic;on the formal specification of temporal deontic constraints;validity queries and completeness queries;explanation for cooperative information systems;toward intelligent representation of database content;reducing information systems with uncertain attributes;object and dependency oriented programming in FLO;knowledge simplification;a model-based approach to consistency-checking;resource-based vs task-based approaches for scheduling problems;a fuzzy behaviorist approach to sensor-based robot control;knowledge-based fuzzy neural networks;coevolutionary game theoretic multi-agent systems;searching for features defined by hyperplanes;inductive database design and enhancing query processing of information systems.
this paper provides a novel technique for the analysis of randomized algorithms for optimization problems on metric spaces, by relating the randomized performance ratio for any, metric space to the randomized performa...
详细信息
this paper provides a novel technique for the analysis of randomized algorithms for optimization problems on metric spaces, by relating the randomized performance ratio for any, metric space to the randomized performance ratio for a set of "simple" metric spaces. We define a notion of a set of metric spaces that probabilistically-approximates another metric space. We prove that any metric space can be probabilistically-approximated by hierarchically well-separated trees (HST) with a polylogarithmic distortion. these metric spaces are "simple" as being: (1) tree metrics; (2) natural for applying a divide-and-conquer algorithmic approach. the technique presented is of particular interest in the context of on-line computation. A large number of on-line algorithmic problems, including metrical task systems, server problems, distributed paging, and dynamic storage rearrangement are defined in terms of some metric space. Typically for these problems, there are linear lower bounds on the competitive ratio of deterministic algorithms. Although randomization against an oblivious adversary has the potential of overcoming these high ratios, very little progress has been made in the analysis. We demonstrate the use of our technique by obtaining substantially improved results for two different on-line problems.
the proceedings contains 60 papers. Topics discussed include distributed computingsystems, software tools, real-time communication, transaction processing, communication protocols and software, mutual exclusion and d...
详细信息
the proceedings contains 60 papers. Topics discussed include distributed computingsystems, software tools, real-time communication, transaction processing, communication protocols and software, mutual exclusion and deadlock detection, real-time distributed systems, logging and recovery, performance of communication systems, object-based systems, remote procedure call and group communication, monitoring and testing, distributed databases, theory and algorithms, distributed systems architecture, task allocation and load balancing, specification and protocol implementation.
the proceedings contains 47 papers on the applications of computing to natural sciences. Topics discussed include DNA sequences, proteins, biology, data structures, databases, computer systems, algorithms, molecular s...
详细信息
ISBN:
(纸本)0818650907
the proceedings contains 47 papers on the applications of computing to natural sciences. Topics discussed include DNA sequences, proteins, biology, data structures, databases, computer systems, algorithms, molecular structures, genomes, data reduction, drugs, computer programming, computer programming languages, user interfaces, computer graphics and systems analysis.
the proceedings contains 70 papers. Topics discussed include artificial intelligence, software engineering, intelligent automation, human computer interactions, machine learning, artificial intelligence applications, ...
详细信息
the proceedings contains 70 papers. Topics discussed include artificial intelligence, software engineering, intelligent automation, human computer interactions, machine learning, artificial intelligence applications, digital libraries, parallel processing in real world databases, and evaluation of artificial intelligence systems.
the proceedings contains 109 papers from the international Phoenix conference on Computers and Communications. Some of the topics discussed include: multiprocessor verification;self-stabilizing algorithms;distributed ...
详细信息
the proceedings contains 109 papers from the international Phoenix conference on Computers and Communications. Some of the topics discussed include: multiprocessor verification;self-stabilizing algorithms;distributed computingsystems;load balancing;scheduling;network protocols;optical communication;Cayley graphs;user interfaces;computer architecture;computer simulation;and bit error rates.
暂无评论