509 search results - page 62 / 102 » On the completeness of compositional reasoning methods |
132
click to vote
JMLC
2000
Springer
15 years 7 months ago
2000
Springer
Most object-oriented languages offer a limited number of invocation semantics. At best, they define a default mode of synchronous invocation, plus some keywords to express addition...
122
click to vote
COMCOM
2007
15 years 4 months ago
2007
Path probing is essential to maintaining an efficient overlay network topology. However, the cost of a full-scale probing is as high as O(n2 ), which is prohibitive in large-scale...
117
click to vote
RAS
1998
15 years 3 months ago
1998
We present a new approach to the multi-robot path planning problem, where a number of robots are to change their positions through feasible motions in the same static environment....
149
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
137
click to vote
RSCTC
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...