Sciweavers

494 search results - page 26 / 99
» Heap Building Bounds
Sort
View
ICALP
2000
Springer
15 years 7 months ago
A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols
We study contention-resolution protocols for multiple-access channels. We show that every backoff protocol is transient if the arrival rate, , is at least 0.42 and that the capaci...
Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, ...
135
Voted
ESA
2009
Springer
146views Algorithms» more  ESA 2009»
15 years 10 months ago
Kernel Bounds for Disjoint Cycles and Disjoint Paths
In this paper, we give evidence for the problems Disjoint Cycles and Disjoint Paths that they cannot be preprocessed in polynomial time such that resulting instances always have a ...
Hans L. Bodlaender, Stéphan Thomassé...
ATAL
2007
Springer
15 years 10 months ago
An adversarial environment model for bounded rational agents in zero-sum interactions
Multiagent environments are often not cooperative nor collaborative; in many cases, agents have conflicting interests, leading to adversarial interactions. This paper presents a ...
Inon Zuckerman, Sarit Kraus, Jeffrey S. Rosenschei...
125
Voted
SIBGRAPI
2005
IEEE
15 years 9 months ago
Boolean Operations on Surfel-Bounded Objects Using Constrained BSP-Trees
Point-based modeling and rendering is an active area of research in Computer Graphics. The concept of points with attributes (e.g. normals) is usually referred to as surfels, and ...
Marcus A. C. Farias, Carlos Eduardo Scheidegger, J...
110
Voted
RT
2001
Springer
15 years 8 months ago
An Illumination Model for a Skin Layer Bounded by Rough Surfaces
In this paper we present a novel illumination model that takes into account multiple anisotropic scattering in a layer bounded by two rough surfaces. We compute the model by a dis...
Jos Stam