494 search results - page 70 / 99 » Heap Building Bounds |
156
click to vote
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
144
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
135
Voted
SIROCCO
2007
15 years 5 months ago
2007
Abstract. The problem we consider originates from the design of efficient on-board networks in satellites (also called Traveling Wave Tube Amplifiers). Signals incoming in the net...
126
Voted
SIROCCO
2004
15 years 5 months ago
2004
Shareable data services providing consistency guarantees, such as atomicity (linearizability), make building distributed systems easier. However, combining linearizability with ef...
168
Voted
IWFM
2003
15 years 5 months ago
2003
We present a report on work in progress on certain aspects of a programme of research concerned with building formal, mathematical models both for aspects of the computational pro...