2095 search results - page 339 / 419 » Improved pebbling bounds |
ATAL
1997
Springer
14 years 2 months ago
1997
Springer
Abstract. Just as cooperation in multi-agent systems is a central issue for solving complex tasks, so too is the ability for an intelligent agent to reason about combined knowledge...
CP
1997
Springer
14 years 2 months ago
1997
Springer
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
COMPGEOM
1996
ACM
14 years 2 months ago
1996
ACM
Given a simple arrangementof n pseudolines in the Euclidean plane, associate with line i the list i of the lines crossing i in the order of the crossings on line i. i = ( i 1; i 2;...
VLDB
1997
ACM
14 years 2 months ago
1997
ACM
Abstract: Recently there has been an increasing interest in supporting bulk operations on multidimensional index structures. Bulk loading refers to the process of creating an initi...
COMPGEOM
1993
ACM
14 years 2 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...