Sciweavers

853 search results - page 27 / 171
» Are many small sets explicitly small
Sort
View
RSA
2008
89views more  RSA 2008»
15 years 5 months ago
Simple permutations mix even better
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask how many randomly selected simple permutations need be composed to...
Alex Brodsky, Shlomo Hoory
ICML
2004
IEEE
16 years 7 months ago
Apprenticeship learning via inverse reinforcement learning
We consider learning in a Markov decision process where we are not explicitly given a reward function, but where instead we can observe an expert demonstrating the task that we wa...
Pieter Abbeel, Andrew Y. Ng
ICSE
1999
IEEE-ACM
15 years 10 months ago
Dynamically Discovering Likely Program Invariants to Support Program Evolution
ÐExplicitly stated program invariants can help programmers by identifying program properties that must be preserved when modifying code. In practice, however, these invariants are...
Michael D. Ernst, Jake Cockrell, William G. Griswo...
ATAL
2006
Springer
15 years 10 months ago
Robust mechanisms for information elicitation
We study information elicitation mechanisms in which a principal agent attempts to elicit the private information of other agents using a carefully selected payment scheme based o...
Aviv Zohar, Jeffrey S. Rosenschein
APPROX
2009
Springer
125views Algorithms» more  APPROX 2009»
16 years 23 days ago
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
Adam Meyerson, Brian Tagiku