2206 search results - page 316 / 442 » On the power of coercion abstraction |
INFOCOM
2000
IEEE
14 years 2 months ago
2000
IEEE
Abstract—A challenging aspect of mobile communications consists in exploring ways in which the available run time of terminals can be maximized. In this paper, we present a detai...
CL
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. This paper proposes to promote constraints to first-class status. In contrast to constraint propagation, which performs inference on values of variables, first-class co...
CP
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. Among backtracking based algorithms for constraint satisfaction problems (CSPs), algorithms employing constraint propagation, like forward checking (FC) and MAC, have had...
ESOP
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
DCC
1998
IEEE
14 years 2 months ago
1998
IEEE
Abstract. The Burrows-Wheeler transform (BWT) and block sorting compression are closely related to the context trees of PPM. The usual approach of treating BWT as merely a permutat...