1529 search results - page 264 / 306 » Search Space Analysis of the Linear Ordering Problem |
CCR
2004
13 years 8 months ago
2004
Abstract-- The vision is tantalizing: a high-performance, scalable, and widely deployed wireless Internet that facilitates services ranging from radically new and unforeseen applic...
SMA
2008
ACM
13 years 8 months ago
2008
ACM
In this paper we consider the problem of monitoring an art gallery modeled as a polygon, the edges of which are arcs of curves. We consider two types of guards: edge guards (these...
SIGMOD
2012
ACM
11 years 11 months ago
2012
ACM
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
CP
1998
Springer
14 years 1 months ago
1998
Springer
We study how constraint-based static analysis can be applied to the automated and systematic debugging of program errors. Strongly moding and constraint-based mode analysis are tur...
JPDC
2006
13 years 8 months ago
2006
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...