Sciweavers

2517 search results - page 390 / 504
» Specifying Weak Sets
Sort
View
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
15 years 8 months ago
Parallel monotonicity reconstruction
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
Michael E. Saks, C. Seshadhri
TAMODIA
2008
15 years 8 months ago
A Fluid Flow Approach to Usability Analysis of Multi-user Systems
Abstract. The analysis of usability aspects of multi-user systems, such as cooperative work systems and pervasive systems, pose particular problems because group behavior of their ...
Mieke Massink, Diego Latella, Maurice H. ter Beek,...
AAAI
2006
15 years 8 months ago
Local Negotiation in Cellular Networks: From Theory to Practice
This paper describes a novel negotiation protocol for cellular networks, which intelligently improves the performance of the network. Our proposed reactive mechanism enables the d...
Raz Lin, Daphna Dor-Shifer, Sarit Kraus, David Sar...
AAAI
2006
15 years 8 months ago
Optimal Scheduling of Contract Algorithms for Anytime Problems
A contract algorithm is an algorithm which is given, as part of the input, a specified amount of allowable computation time. The algorithm must then compute a solution within the ...
Alejandro López-Ortiz, Spyros Angelopoulos,...
ALENEX
2004
107views Algorithms» more  ALENEX 2004»
15 years 8 months ago
Approximating the Visible Region of a Point on a Terrain
Given a terrain T and a point p on or above it, we wish to compute the region Rp that is visible from p. We present a generic radar-like algorithm for computing an approximation o...
Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz