1512 search results - page 257 / 303 » connection 2006 |
109
click to vote
CORR
2006
Springer
14 years 12 months ago
2006
Springer
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
103
click to vote
CORR
2006
Springer
14 years 12 months ago
2006
Springer
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
CORR
2006
Springer
14 years 12 months ago
2006
Springer
We present in this paper a library to compute with Taylor models, a technique extending interval arithmetic to reduce decorrelation and to solve differential equations. Numerical s...
CORR
2006
Springer
14 years 12 months ago
2006
Springer
Following the ideas of the Remote Procedure Call model, we have developed a logic programming counterpart, naturally called Prolog Remote Predicate Call (Prolog RPC) [1]. The Prol...
CORR
2006
Springer
14 years 12 months ago
2006
Springer
Although the Internet AS-level topology has been extensively studied over the past few years, little is known about the details of the AS taxonomy. An AS "node" can repre...