Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
: The goal of this paper is to describe how the development, implementation, and deployment of Information System of University of Latvia changed the life of the University and fac...
Inverted index compression, block addressing and sequential search on compressed text are three techniques that have been separately developed for e cient, low-overhead text retrie...
Gonzalo Navarro, Edleno Silva de Moura, Marden S. ...
Mechanized reasoning systems and computer algebra systems have different objectives. Their integration is highly desirable, since formal proofs often involve both of the two differ...
XML schema design has two opposing goals: elimination of update anomalies requires that the schema be as normalized as possible; yet higher query performance and simpler query exp...
Nuwee Wiwatwattana, H. V. Jagadish, Laks V. S. Lak...