نتایج جستجو برای: gramming

تعداد نتایج: 158  

1990
Ryszard S. Michalski Jaime G. Carbonell Tom M. Mitchell

Software components developed with an object-oriented language undergo considerable repro-gramming before they become reusable in a wide range of applications or domains. Tools andmethodologies are therefore needed to cope with the complexity of designing, updating and reor-ganizing vast collections of classes. This paper describes several techniques for controllingchange in obj...

1995
Craig Sayers Angela Lai Richard P. Paul

The objective of this work is to allow subsea teleop-erative tasks to be performed eeciently even when all communication between human operator and remote robot is via an acoustic link. This paper describes the integration of remote site cameras into the telepro-gramming system. Images from these cameras may be used for calibrating and maintaining the world model as well as for aiding the opera...

Journal: :SIAM Journal on Optimization 2000
Houyuan Jiang Daniel Ralph

Mathematical programs with nonlinear complementarity constraints are refor-mulated using better-posed but nonsmooth constraints. We introduce a class offunctions, parameterized by a real scalar, to approximate these nonsmooth prob-lems by smooth nonlinear programs. This smoothing procedure has the extrabenefits that it often improves the prospect of feasibility and stability...

Journal: :ECEASST 2008
Karl Azab Karl-Heinz Pennemann

Templates are a language feature of C++ and can be used for metapro-gramming. The metaprogram is executed by the compiler and outputs source code which is then compiled. Templates are widely used in software libraries but few tools exist for programmers developing template code. In particular, error messages are often cryptic. During template instantiation, a compiler looks up names that depend...

2012
Byoung Tak Zhang Soo Yong Shin

Two new molecular algorithms are presented that are designed for the improvement of e ciency and reliability of DNA computing The rst algorithm introduces an evolutionary cycle to guide chemical reactions of DNA molecules The second molecular algorithm extends the rst one by adding another evolutionary loop for op timizing encodings of the problem instance Just as genetic programming is a metho...

1992
Georges Quénot Bertrand Zavidovique

This paper presents a data ow computer constituted of a large array of data ow processors and programmed using a functional language and its application to real time image processing The approach integrates tightly and e ciently the data ow architecture principle and the functional pro gramming concept It leads to a very simple and reg ular hardware It also provides a very e cient and user frie...

1991
D. B. Gannon L. H. Jamieson

This paper describes an X-window based softwareenvironment called HeNCE (Heterogeneous NetworkComputing Environment) designed to assist scientistsin developing parallel programs that run on a networkof computers. HeNCE is built on top of a softwarepackage called P M which supports process manage-ment and communication between a network of hetero-geneous computers. He...

Journal: :Math. Program. 1998
Jos F. Sturm Shuzhong Zhang

We propose a polynomial time primal dual potential reduction algorithm for linear pro gramming The algorithm generates sequences d and v rather than a primal dual interior point xk sk where di q xi s k i and v k i q xi s k i for i n Only one element of d is changed in each iteration so that the work per iteration is bounded by O mn us ing rank one updating techniques The usual primal dual itera...

1999
Sarita V Adve Vijay S Pai

The memory consistency model of a shared memory sys tem determines the order in which memory operations will appear to execute to the programmer The memory consis tency model for a system typically involves a tradeo be tween performance and programmability This paper pro vides an overview of recent advances in hardware optimiza tions compiler optimizations and programming environ ments relevant...

2000
Pascal Hitzler Anthony Karel Seda

Many questions concerning the semantics of disjunctive databases and of logic pro gramming systems depend on the xed points of various multivalued mappings and operators determined by the database or program We discuss known versions for mul tivalued mappings of the Knaster Tarski theorem and of the Banach contraction map ping theorem and formulate a version of the classical xed point theorem s...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید