406 search results - page 74 / 82 » Pseudorandomness and Combinatorial Constructions |
159
click to vote
CJ
2010
15 years 3 months ago
2010
A policy for a minimal reactive agent is a set of condition-action rules used to determine its response to perceived environmental stimuli. When the policy pre-disposes the agent t...
144
click to vote
SIAMCOMP
2010
15 years 24 days ago
2010
We describe algorithms to compute the shortest path homotopic to a given path, or the shortest cycle freely homotopic to a given cycle, on an orientable combinatorial surface. Unli...
167
click to vote
SPIC
2010
15 years 23 days ago
2010
This paper presents a complete framework for attention-based video streaming for low bandwidth networks. First, motivated by the fovea-periphery distinction of biological vision s...
268
click to vote
Publication
Modern hardware description languages support code-generation constructs like generate/endgenerate in Verilog. These constructs are intended to describe regular or parameterized ha...
207
click to vote
FOCS
2005
IEEE
15 years 11 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...