1033 search results - page 21 / 207 » The Relative History Heuristic |
TIT
1998
14 years 11 months ago
1998
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
CADE
2010
Springer
15 years 27 days ago
2010
Springer
In this paper we use the decreasing diagrams technique to show that a left-linear term rewrite system R is confluent if all its critical pairs are joinable and the critical pair st...
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
CAISE
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, we present a heuristic approach for finding errors and possible improvements in business process models. First, we translate the information that is included in a m...
126
click to vote
ASP
2005
Springer
15 years 5 months ago
2005
Springer
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...