Sciweavers

602 search results - page 41 / 121
» Program Calculation in Coq
Sort
View
CIAC
1997
Springer
111views Algorithms» more  CIAC 1997»
14 years 2 months ago
A Meticulous Analysis of Mergesort Programs
The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...
Jyrki Katajainen, Jesper Larsson Träff
COLING
1992
13 years 11 months ago
Dynamic Programming Method for Analyzing Conjunctive Structures in Japanese
Parsing a long sentence is very difficult, since long sentences often have conjunctions which result in ambiguities. If the conjunctive structures existing in a long sentence can ...
Sadao Kurohashi, Makoto Nagao
EM
2010
134views Management» more  EM 2010»
13 years 10 months ago
High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
Abstract. The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere. Bachoc and...
Hans D. Mittelmann, Frank Vallentin
CORR
2008
Springer
111views Education» more  CORR 2008»
13 years 8 months ago
Concave Programming Upper Bounds on the Capacity of 2-D Constraints
The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distribut...
Ido Tal, Ron M. Roth
IJACTAICIT
2010
95views more  IJACTAICIT 2010»
13 years 7 months ago
Expert System Design of Two Electrostatic Lenses Column by Mixing Dynamic Programming and AI Techniques
This paper have shown an expert system design by using optimization methods for the Focused ion beam FIB optical system, by mixing the dynamic programming procedure and artificial...
Fadhil A. Ali