Filters








99,811 Hits in 6.3 sec

Page 3755 of Mathematical Reviews Vol. , Issue 86h [page]

1986 Mathematical Reviews  
{For the entire collection see MR 85k:68008.} Andrea Maggiolo-Schettini (Pisa) 86h:68051 Smolka, Scott A. (1-SUNYS) 86h:68052 Polynomial-time analysis for a class of communicating processes.  ...  We present an algorithm for this problem that runs in polynomial (quadratic) time for a significant class of communicating processes.  ... 

Page 4650 of Mathematical Reviews Vol. , Issue 85j [page]

1985 Mathematical Reviews  
Milner’s CCS [A calculus of communicating systems, Springer, Berlin, 1980; MR 82g:68001], and languages derived from C. A. R. Hoare’s CSP (Communicating Sequential Processes) [Comm.  ...  Author’s summary: “We present a new analysis for bounding the average computational effort of sequential decoding.  ... 

Complexity and mission computability of adaptive computing systems [article]

Venkat R. Dasari, Mee Seong Im, Billy Geerhart
2018 arXiv   pre-print
We define a subclass of deterministic polynomial time complexity class called mission class, as many polynomial problems are not computable in mission time.  ...  There is a subset of computational problems that are computable in polynomial time for which an existing algorithm may not complete due to a lack of high performance technology on a mission field.  ...  Availability of the limited amount of energy and battery power, the timing of communication lines for crucial decision-making, and the efficiency of available central processing power (CPU) that are accessible  ... 
arXiv:1808.09586v1 fatcat:cubu5owxs5etpeoo2p7zyq3azm

Efficient fine-grained data access control in wireless sensor networks

Qian Wang, Kui Ren, Cong Wang, Wenjing Lou
2009 MILCOM 2009 - 2009 IEEE Military Communications Conference  
To revoke k (0 ::; k ::; N) users at one time, the degree of the the revocation polynomial q2(x) is at most N /2.The proof is quite easy to obtained from the analysis in Section IV-A.  ...  In the analysis of communication overhead, we have implicitly assumed that the overhead mainly comes from the degree of the revocation polynomial, i.e., the number of coefficients.  ... 
doi:10.1109/milcom.2009.5379991 fatcat:ecdstvtdkbbrzd3sf3rrm4n77a

Page 289 of Mathematical Reviews Vol. , Issue 81A [page]

1981 Mathematical Reviews  
communication; and (iii) suggest a rigorous framework for dealing with termination and deadlock of communicating processes.”  ...  from which optimal code can be generated in polynomial time for a class of stack machines.” 81a:68092 Sippu, Seppo; Soisalon-Soininen, Eljas 81a:68093a A scheme for LR(X) parsing with error recovery.  ... 

Tidal Data Analysis Using Ann

Ritu Vijay, Rekha Govil
2008 Zenodo  
The design of a complete expansion that allows for compact representation of certain relevant classes of signals is a central problem in signal processing applications.  ...  In this age of ever-increasing digitization in the storage, processing, analysis and communication of information, there are numerous examples of applications where one needs to construct a continuously  ...  The VLSI implementability of ANN can prove a boon to signal processing science community to design embedded systems for such applications e.g. a tidal height & time predictor portable tool (expert system  ... 
doi:10.5281/zenodo.1056083 fatcat:zzaydm4sezazdle3bbusatezda

A parallelization of orchard temperature predicting programs

Elad Mazurek, Munehiro Fukuda
2011 Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing  
Although a couple of algorithms using artificial neural network and empirically-formulated polynomials are available to the public, they need to be parallelized for useful on-the-fly prediction.  ...  This paper demonstrates the MASS library's suitability to parallelization of temperature prediction programs for on-the-fly sensor-data analysis by (1) porting the programs to MASS, (2) running them in  ...  Measurements are in Milliseconds and show total processing time for each number of data files along with number of CPU cores utilized.  ... 
doi:10.1109/pacrim.2011.6032889 fatcat:kareytrnqzdpdfvqycoz2skfoe

Application of an Exact Transversal Hypergraph in Selection of SM-Components [chapter]

Łukasz Stefanowicz, Marian Adamski, Remigiusz Wisniewski
2013 IFIP Advances in Information and Communication Technology  
Since the recognition and generation of the first transversal in the xt-hypergraphs are both polynomial, the complete selection process can be performed in polynomial time.  ...  Such a reduction can be done if the selection hypergraph belongs to the exact transversal hypergraphs (xt-hypergraphs) class.  ...  The research was partially financed from budget resources intended for science in 2010-2013 as an own research project No. N N516 513939.  ... 
doi:10.1007/978-3-642-37291-9_27 fatcat:xou2bgnzc5grhgl56fqkck2i2e

Page 2833 of Mathematical Reviews Vol. , Issue 89E [page]

1989 Mathematical Reviews  
This paper gives a new class of graphs, called weakly cut-symmetric graphs, for which SMP and UP allow polynomial time algorithms.  ...  For this class, the author has devised a polynomial time algorithm using the Euler tour technique that finds an optimal uniform parti- tion.  ... 

Page 3364 of Mathematical Reviews Vol. , Issue 91F [page]

1991 Mathematical Reviews  
Summary: “A probabilistic self-stabilizing algorithm for a ring of identical processes is presented; the number of processes in the ring is odd, the processes operate synchronously, and communication is  ...  A new result is an algorithm to find shortest possible reset sequences for monotonic automata in polynomial time. The result is extended to certain classes of non- monotonic automata.  ... 

Fuzzy Model for Parameterized Sign Language

Sumaira Kausar, Samabia Tehsin, M. Younus Javed
2016 International Journal of Engineering and Applied Computer Science  
This is the reason for selecting fuzzy inference for the proposed SLR system and experimental analysis has proven its suitability for SLR.  ...  The meticulous statistical analysis performed for proposed PSL-FM has shown very promising results.  ...  This time analysis is just a way of comparing the time efficiency of different alternatives for PSL recognition. The proposed methodology does not involve any training so training time is zero.  ... 
doi:10.24032/ijeacs/0101/05 fatcat:6ycnx6oqlvf75od2sovx4kgiae

Page 1658 of Mathematical Reviews Vol. , Issue 83d [page]

1983 Mathematical Reviews  
A. R. 83d:68008 A calculus of total correctness for communicating processes. Sci. Comput. Programming 1 (1981/82), no. 1-2, 49-72.  ...  of knowing whether the computation power of a nondeterministic Turing machine which accepts a set in polynomial time is strictly stronger than the power of ordinary polynomially bounded Turing machines  ... 

Page 72 of Mathematical Reviews Vol. , Issue 89C [page]

1989 Mathematical Reviews  
The complexities of some natural location-allocation problems are localized in the range between the classes NP and A} of the polynomial-time hierarchy.  ...  {For the entire collection see MR 89b:68011.} 89c:68030 68Q10 03B70 Hoare, C. A. R. (4-OX-C) Algebraic specifications and proofs for communicating sequential processes.  ... 

The Effects of Different Kernels in SVM Sentiment Analysis on Mass Social Distancing

Komang Dhiyo Yonatha Wijaya, Anak Agung Istri Ngurah Eka Karyawati
2020 Jurnal Elektronik Ilmu Komputer Udayana  
To filter that kind of tweets, a sentiment analysis was performed with SVM and 3 different kernel method. Tweets are labelled into 3 classes of positive, neutral, and negative.  ...  During this pandemic, social media has become a major need as a means of communication. One of the social medias used is Twitter by using messages referred to as tweets.  ...  Stopword removal is a process for removing words that are very commonly used and have no meaning in performing sentiment analysis. Stopword removal is done to make the process run more efficiently.  ... 
doi:10.24843/jlk.2020.v09.i02.p01 fatcat:gosbg5mi2zb4pnxurgzvwuiaoe

Randomized Search Heuristics as an Alternative to Exact Optimization [chapter]

Ingo Wegener
2004 Lecture Notes in Computer Science  
Here, a framework for a theory of randomized search heuristics is presented.  ...  Afterwards, the tools for such an analysis are described and applied to some well-known discrete optimization problems.  ...  The class of pure EAs is already large and there is the freedom of adding problem-specific modules. Arguments for the Analysis of the Expected Optimization Time Do we need a theory of RSHs?  ... 
doi:10.1007/978-3-540-25967-1_10 fatcat:bljnrvohjvehldjl275j2x5eo4
« Previous Showing results 1 — 15 out of 99,811 results