Skip to search formSkip to main contentSkip to account menu

Correctness (computer science)

Known as: Partial, Correctness, Provably correct 
In theoretical computer science, correctness of an algorithm is asserted when it is said that the algorithm is correct with respect to a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
This paper highlights the significance of classification in data mining and knowledge discovery. In this paper we investigate the… 
2007
2007
Based on the refinement of two existing techniques, this paper describes the work that introduced region of interest for more… 
Highly Cited
2005
Highly Cited
2005
Despite being the subject of many years of research, distributed channel assignment remains a challenging problem. In this paper… 
Highly Cited
2002
Highly Cited
2002
While empirical evaluations are a common research method in some areas of Artificial Intelligence (AI), others still neglect this… 
Highly Cited
2001
Highly Cited
2001
We establish a refined search tree technique for the parameterized Dominating Set problem on planar graphs. Here, we are given an… 
Highly Cited
1996
Highly Cited
1996
This paper reports the first phase of a project whose aim is the automatic generation of tool center trajectories for robots… 
1994
1994
We develop several simple operational models of Occam at different levels of abstraction, and relate them by relative correctness… 
Highly Cited
1991
Highly Cited
1991
A system consisting of n identical processors connected by links in which some processors could be faulty is considered… 
Highly Cited
1990
Highly Cited
1990
We present a theory of plan modification applicable to hierarchical nonlinear planning. Our theory utilizes the validation… 
Highly Cited
1984
Highly Cited
1984
the Rouse models provides a general description of the dynamical behavior on length scales up to 40 A and time scales to the lo…