8825 search results - page 18 / 1765 » All for one or one for all |
IJCAI
2003
13 years 9 months ago
2003
In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and ...
OPODIS
2003
13 years 9 months ago
2003
A fundamental problem in distributed computing is performing a set despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processor...
MVA
1998
13 years 9 months ago
1998
This paper is concerned with the enhancement of the visual feedback for the teleoperator of an all-terrain fast mobile robot. Indeed, remote control trials have shown inferior mob...
TC
2008
13 years 7 months ago
2008
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
SIAMDM
1998
13 years 7 months ago
1998
The richest class of t-perfect graphs known so far consists of the graphs with no so-called odd-K4. Clearly, these graphs have the special property that they are hereditary t-perfe...