检索结果-内蒙古大学图书馆

8th International symposium on Methodologies for Intelligent systems, ISMIS 1994

作者： Lever, Jonathan Richards, Barry IC-Parc Imperial College LondonSW7 2AZ United Kingdom

ISBN: (纸本)9783540584957

We describe the generic planning architecture parcPLAN, which uses constraint-solving to perform both temporal and non-temporal reasoning. the architecture allows considerable temporal sophistication in the specification of actions, integrity constraints and planning problems, and produces plans with a high degree of concurrency in action execution. A feature of parcPLAN is the capability to represent and minimise costs associated with plans. parcPLAN has been implemented in the Constraint Logic programming language ECLiPSe, and performs well on large-scale planning and resource allocation problems. © Springer-Verlag Berlin Heidelberg 1994.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

An off-line graphical environment for programming robots using commercial cad systems

An off-line graphical environment for programming robots usi...

引用

ASME 1994 International Computers in Engineering Conference and Exhibition, CIE 1994 and the ASME 1994 8th Annual Database symposium collocated with the ASME 1994 Design Technical Conferences

作者： Abdel-Malek, Karim A. Department of Engineering UTI Corporation CollegevillePA United States

ISBN: (纸本)9780791813805

Because current robot teaching methods are inadequate to fully control a higli accuracy manipulator, the concept of a graphical interface which combines both teaching and programming methods is presented here. the complexity of user interfaces has become significant as manipulators and other programmable automation are applied to more industrial applications. three dimensional visualization is an increasingly important aspect of tlie problem facing robotics programmer. Often the effector coordinates passed to the manipulator are not easily visualized in space. the introduction of a graphical environment tlie reduces the task of visualizing points, orientations, and trajectories. the environment developed here (tlie "TR-Environment") provides tlie user with an off-line programming method where logic, repetitive tasks, and sensory control can be simplified. Tlie environment consists of tlie integration of commercial CAD packages with computer languages. the program utilizes the so called "NODES" wliich define tlie six generalized coordinates and tlie state of the end-effector at a point in space. Trajectories in space can be planned by connecting nodes via "entities". A new language ("Criptic") associated with nodes where program branching, sensory control, digital communication, and adaptive control occurs, has been developed. © 1994 American Society of Mechanical Engineers (ASME). All rights reserved.

关键词： Computer aided design

来源：评论

学校读者我要写书评

暂无评论

A control strategy based on heuristic techniques for the parallel execution of logic programs

A control strategy based on heuristic techniques for the par...

引用

International symposium on Parallel Processing

作者： G. Jain B. Ramkumar J.G. Kuhl Electrical and Computer Engineering University of Iowa Iowa IA USA

We apply parallel heuristic solving techniques to the exponentially complex problem of interpretation of pure logic programs. Parallel heuristics incorporated within the control strategy employed to solve logic programs are used to guide the search for a solution in parts of the search space most likely to yield a solution. the results show that our strategy when applied to standard benchmarks not only improves the time taken to arrive at a solution by more than a linear factor, but reduces the memory requirements as well.< >

关键词： Logic programming Concurrent computing Cities and towns Computer languages Constraint optimization NP-hard problem Automatic control Control systems

来源：评论

学校读者我要写书评

暂无评论

8th Annual symposium on theoretical Aspects of Computer Science, STACS 1991

引用

8th Annual symposium on theoretical Aspects of Computer Science, STACS 1991

ISBN: (纸本)9783540537090

the proceedings contain 51 papers. the special focus in this conference is on theoretical Aspects of Computer Science. the topics include: Polymorphism, parameterization and typing;executable higher-order algebraic specifications;efficient memory access in large-scale computation;rational relations with bounded delay;on the power of several queues;on aperiodic trace languages;recognizable and rational languages of finite and infinite traces;on the concatenation of infinite traces;tight RNC approximations to max flow;a natural metric for curves -- computing the distance for polygonal chains and approximation algorithms;decision problems for term rewriting systems and recognizable tree languages;decidable sentences for context-free groups;the owner concept for PRAMs;actors as a parallel programming model;average case analysis of unification algorithms;methodology for proving the termination of logic programs;polynomial size constant depth circuits with a limited number of negations;randomized polynomials, threshold circuits, and the polynomial hierarchy;computationally convincing proofs of knowledge;interactive proof systems and alternating time-space complexity;optimal tradeoffs between time and bit complexity in distributed synchronous rings;unconditional byzantine agreement with good majority;a new compacting garbage-collection algorithm with a good average-case performance;bisimulation and action refinement;testing for unboundedness of FIFO channels;detection of deadlocks in an infinite family of nets;nondeterminism within p;structure and importance of logspace-MOD-classes;complexity classification of truth maintenance systems;Reachability in reversible free choice systems;bounded reductions and functional oracle queries as a measure of parallel time.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Para-functional programming: A paradigm for programming multiprocessor systems 86

Para-functional programming: A paradigm for programming mult...

引用

13th AnnuaJ ACM symposium on the Principles of programming languages, POPL 1986

作者： Hudak, Paul Smith, Lauren Yale University Department of Computer Science United States

ISBN: (纸本)089791175X

One of the most important pragmatic advantages of functional languages is that concurrency in a program is implicit-there is no need for special constructs to express parallelism as is required in most conventional languages. Furthermore, it is fairly easy for compilers to automatically determine the concurrency as a step toward decomposing a program for execution on a suitable parallel architecture. Yet it is often the case that one knows precisely the optimal decomposition for execution on a particular machine, and one can never expect a compiler to determine such optimal mappings in all cases. this paper is concerned with ways to allow the programmer to explicitly express this mapping of program to machine, by using annotations that, given a few minor constraints, cannot alter the functional semantics of the program. We show through several deeded examples the expressiveness and conciseness of the resulting " para-functional programming methodology, using an experimental language called ParAlfl based on our ideas. We also give a formal denotational description of the mapping semantics using a notion of execution trees.

关键词： Functional programming

来源：评论

学校读者我要写书评

暂无评论

Conference Record of the Annual ACM symposium on Principles of programming languages

Conference Record of the Annual ACM Symposium on Principles ...

引用

8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, POPL 1981

ISBN: (纸本)089791029X

the proceedings contain 23 papers. the topics discussed include: modeling of problem domains for driving program development systems;programming primitives for database languages;paths: an abstract alternative to pointers;program improvement by internal specialization;paging as a 'language processing' task;position paper on optimizing compilers;making the world safe for garbage collection;carrier arrays: an idiom-preserving extension to APL;axiomatic definitions of programming languages, II;formal program testing;the temporal logic of branching time;program logic without binding is decidable;on the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem;a program development tool;program verification based on denotational semantics;incremental evaluation for attribute grammars with application to syntax-directed editors;linear cost is sometimes quadratic;a precise inter-procedural data flow algorithm;verification of attribute grammar;dependence graphs and compiler optimizations;program optimization and exception handling;and inferring types in Smalltalk.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Inferring types in smalitalk 8

Inferring types in smalitalk

引用

8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, POPL 1981

作者： Suzuki, Norihisa Xerox Palo Alto Research Centers 3333 Coyote Hill Rd Palo AltoCA94304 United States

ISBN: (纸本)089791029X

Smalitalk is an object-oriented language designed and implemented by the Learning Research Group of the Xerox Palo Alto Research Center [2, 5, 14], Some features of this language are: abstract data classes, in formation inheritance by a superclass-subclass mechanism, message passing semantics, extremely late binding, no type declarations, and automatic storage management. Experience has shown that large complex systems can be written in Smalitalk in quite a short period of time;it is also used to teach programming to children quite effectively. Object-oriented languages like Smalitalk have begun to be accepted as friendly languages for novice programmers on personal computers. However, Smalitalk has some drawbacks, too. Smalitalk programs are inefficient compared with Lisp or Pascal. Late binding is a major reason of this inefficiency;every time a procedure is called, its implementation in the current context has to be found. Because of late binding, whether there is an implementation of a procedure call or not can only be found at run-time. this may be convenient in the early stages of system development;one can run a partially completed system, and when he discovers a run-time error caused by an unimplemented procedure, he can write the procedure body and proceed the computation from the point where the error was discovered. However, there is no way to guarantee that there will be no run-time errors. We found many "completed" systems which still had such run-time errors. Another problem is that it is hard for a novice to read Smalltalk programs written by other people. the fact that there are no type declarations and the fact that the bindings are late are major causes of unreadability. All the Smalltalk procedures are so called generic procedures. Each procedure name is associated with several procedure bodies declared in different classes. Depending on the classes of the arguments of a procedure call different procedure bodies are invoked. Since the classes of t

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

TOWARDS A PARALLEL SIMULA MACHINE.

Conference Proceedings - Annual Symposium on Computer Archit...

引用

Conference Proceedings - Annual symposium on Computer Architecture 1981年 263-278页

作者： Georgiadis, P.I. Papazoglou, M.P. Maritsas, D.G.

SIMULA language has been designed as a general-purpose programming tool and is particularly offered for describing and efficiently simulating large-scale systems. Such simulation models are usually characterized by inherent parallelism, which reflects corresponding activities of the system. this kind of natural parallelism remains unexploited by the implementation of the SIMULA language in a uniprocessor machine. the authors have critically assessed SIMULA, and present a scheme that aims towards implementing SIMULA programs in a multiprocessor environment. this scheme establishes a parallel structure to replace the existing quasiparallel SIMULA mechanism. the approach is based on the nature of SIMULA classes and the process interactions. An appropriate process interaction structure is proposed. this structure makes it possible to overcome such problems as mutual exclusion, deadlock, and synchronization. Further, an executive algorithm is outlined to guarantee the correct flow of processes in a multiprocessor environment.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Data flow languages and architectures 81

Data flow languages and architectures

引用

Proceedings of the 8th annual symposium on Computer Architecture

作者： Arvind

Data flow concepts provide a new framework for finding solutions to interrelated problems of exploiting parallelism in the architecture of high-performance multiple processor computers, and of programming and structuring distributed systems. A computer based on data flow principles is a radically different form of stored-program computer in which instructions are activated by arrival of their operands rather than by flow of “control.” these machines have no program counter and no concept of sequential instruction execution. Highly concurrent program execution is a natural consequence of data flow program execution, because many instructions may be activated by data at the same *** laboratories in the United States, Japan, England, and France are currently building prototypes of data flow computers. In this tutorial, we will describe the programming and the architecture of machines being developed at the Massachusetts Institute of Technology.

关键词：

来源：评论

学校读者我要写书评

暂无评论

8th symposium on Mathematical Foundations of Computer Science, MFCS 1979

引用

8th symposium on Mathematical Foundations of Computer Science, MFCS 1979

ISBN: (纸本)9783540095262

the proceedings contain 57 papers. the special focus in this conference is on Mathematical Foundations of Computer Science. the topics include: Lcf: A way of doing proofs with a machine;axioms or algorithms;power from power series;computational complexity of string and graph ident ification;a survey of grammar and l forms-1978;a theoretical study on the time analysis of programs;completeness problems in verification of programs and program schemes;Relationships between AFDL's and cylinders;computable data types;the problem of reachability and verification of programs;program equivalence and provability;interactive L systems with almost interactionless behaviour;on the simplification of constructions in degrees of unsolvability via computational complexity;an algebraic extension of the Chomsky — hierarchy;bounds on computational complexity and approximability of initial segments of recursive sets;on the weighted path length of binary search trees for unknown access probabilities;computational complexity of approximation algorithms for combinatorial problems;a reduct-and-closure algorithm for graphs;small universal Minsky machines;parallel and two-way recognizers of directed acyclic graphs;assertion programming;fully effective solutions of recursive domain equations;a note on computational complexity of a statistical deducibility testing procedure;context free normal systems;new proofs for jump dpda's;synchronization and maximality for very pure subsemigroups of a free semigroup;on the sets of minimal indices of partial recursive functions;some remarks on Boolean sums;on the propositional algorithmic logic;Ch(k) grammars: A characterization of LL(k) languages;a uniform approach to balanced binary and multiway trees;complexity classes of formal languages: Preliminary report.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：