Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,794,577 papers from all fields of science
Search
Sign In
Create Free Account
Computation
Known as:
Computations
, Machine processing
, Computational
Expand
Computation is any type of calculation that follows a well-defined model understood and expressed as, for example, an algorithm. The study of…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
A New Kind of Science
Action selection
Actor model
Analog computer
Expand
Broader (1)
Theoretical computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
CFT exercises for the needs of AGT
A. Mironov
,
S. Mironov
,
A. Morozov
,
A. Morozov
2009
Corpus ID: 16606898
An explicit check of the AGT relation between the W_N-symmetry controlled conformal blocks and U(N) Nekrasov functions requires…
Expand
Highly Cited
2009
Highly Cited
2009
Language Identification on the Web: Extending the Dictionary Method
Radim Rehurek
,
M. Kolkus
Conference on Intelligent Text Processing and…
2009
Corpus ID: 5100263
Automated language identification of written text is a well-established research domain that has received considerable attention…
Expand
Highly Cited
2008
Highly Cited
2008
Ontology Matching with CIDER: Evaluation Report for the OAEI 2008
J. Gracia
,
E. Mena
Organizational Memories
2008
Corpus ID: 1618499
Ontology matching, the task of determining relations that hold among terms of two different ontologies, is a key issue in the…
Expand
Highly Cited
2007
Highly Cited
2007
Fast Handover Scheme for Real-Time Applications in Mobile WiMAX
Wenhua Jiao
,
Pin Jiang
,
Yuanyuan Ma
IEEE International Conference on Communications
2007
Corpus ID: 23882930
Mobile WiMAX is one of the most promising technologies for broadband wireless communication. The IEEE 802.16e standard for Mobile…
Expand
Highly Cited
2007
Highly Cited
2007
A New Local Search Algorithm for the DNA Fragment Assembly Problem
E. Alba
,
Gabriel Luque
EvoCOP
2007
Corpus ID: 30638729
In this paper we propose and study the behavior of a new heuristic algorithm for the DNA fragment assembly problem: PALS. The DNA…
Expand
Review
2000
Review
2000
Actuator fault-tolerant control design: Demonstration on a three-tank-system
H. Noura
,
D. Theilliol
,
D. Sauter
International Journal of Systems Science
2000
Corpus ID: 12447866
Fault-tolerant control or reconfigurable control systems are generally based on a nominal control law associated with a fault…
Expand
Highly Cited
1999
Highly Cited
1999
Spatial Domain Methods for Orientation and Velocity Estimation
Gunnar Farnebäck
1999
Corpus ID: 123689860
In this thesis, novel methods for estimation of orientation and velocity are presented. The methods are designed exclusively in…
Expand
Highly Cited
1999
Highly Cited
1999
Iterative Posterior-Based Keyword Spotting Without Filler Models
M. Silaghi
,
H. Bourlard
1999
Corpus ID: 13948911
Keywords: speech Reference EPFL-CONF-82544 Record created on 2006-03-10, modified on 2017-05-12
Highly Cited
1991
Highly Cited
1991
A maximum‐entropy analysis of the problem of the rotameric distribution for substituted biphenyls studied by 1H nuclear magnetic resonance spectroscopy in nematic liquid crystals
D. Catalano
,
L. D. Bari
,
C. Veracini
,
G. N. Shilstone
,
C. Zannoni
1991
Corpus ID: 15845236
The statistical principle of maximum entropy is applied to the analysis of dipolar couplings from 1H NMR of nonrigid molecules…
Expand
Review
1989
Review
1989
Knowledge Programming in Loops: Report on an Experimental Course
M. Stefik
,
D. Bobrow
,
S. Mittal
,
L. Conway
The AI Magazine
1989
Corpus ID: 2712977
Early this year fifty people took an experimental course at Xerox PARC on knowledge programming in Loops During the course, they…
Expand