نتایج جستجو برای: improvement programming

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

2002
Jedidiah R. Crandall Susan L. Gerhart Jan G. Hogle Susan Gerhart

Repeatedly, news headlines read: "Buffer overflow in vendor’s product allows intruders to take over computer!” This widespread programming mistake is easy to make, exacerbated by the ubiquitous C language, and very simple to exploit. We describe a demonstration (a Java applet) appropriate for a traditional programming course to drive home key points: why buffer overflows occur, how overflows op...

Journal: :Pattern Recognition Letters 2003
Alexander Kolesnikov Pasi Fränti

Approximation of polygonal curves with minimum error (min-e problem) can be solved by dynamic programming, or by graph-theoretical approach. These methods provide optimal solution but they are slow for a large number of vertices. Faster methods exist but they lack the optimality. We try to bridge the gap between the slow but optimal, and the fast but sub-optimal algorithms by giving a new near-...

1994
Michael Hanus

Uniication in the presence of an equational theory is an important problem in theorem-proving and in the integration of functional and logic programming languages. This paper presents an improvement of the proposed lazy uniication methods by incorporating simpliication into the uniication process. Since simpliication is a deterministic computation process, more eecient uniication algorithms can...

2010
Mario Alviano Wolfgang Faber Nicola Leone

Aggregate constructs are one of the major linguistic extensions to logic programming. In this paper, we focus on logic programming with monotone and antimonotone aggregate literals with the well-founded semantics defined in [1], which allows for aggregates occurring in recursive definitions. We formally show that computing this semantics is tractable and present a prototype system obtained by m...

2012
Max Ostrowski

We present the hybrid ASP solver clingcon, combining the simple modeling language and the high performance Boolean solving capacities of Answer Set Programming (ASP) with techniques for using non-Boolean constraints from the area of Constraint Programming (CP). The new clingcon system features an extended syntax supporting global constraints and optimize statements for constraint variables. The...

Journal: :J. Intelligent Manufacturing 2017
Shuya Zhong Yizeng Chen Jian Zhou Yuanyuan Liu

Uncertain variables are used to describe the phenomenon where uncertainty appears in a complex system. For modeling the multi-objective decision-making problems with uncertain parameters, a class of uncertain optimization is suggested for the decision systems in Liu and Chen (2013), http://orsc.edu.cn/online/131020 which is called the uncertain multi-objective programming. In order to solve the...

2006
Ta Quoc Viet Tsutomu Yoshinaga

This study proposes asynchronous MPI, a simple and effective parallel programming model for SMP clusters, to reimplement the High PerformanceLinpack benchmark. The proposed model forces processors of an SMP node to work in different phases, thereby avoiding unneccessary communication and computation bottlenecks. As a result, we can achieve significant improvements in performance with a minimal ...

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

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