882 search results - page 3 / 177 » On self-embeddings of computable linear orderings |
89
Voted
EOR
2008
15 years 14 days ago
2008
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...
107
Voted
TCS
2010
14 years 7 months ago
2010
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...
128
click to vote
FOSSACS
2011
Springer
14 years 3 months ago
2011
Springer
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...
111
Voted
MOC
2002
15 years 2 days ago
2002
Abstract. A new strategy to avoid the order reduction of Runge-Kutta methods when integrating linear, autonomous, nonhomogeneous initial boundary value problems is presented. The s...
111
Voted
TCS
2010
14 years 10 months ago
2010
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which i...