Sciweavers

4047 search results - page 397 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
213
Voted
CORR
2002
Springer
159views Education» more  CORR 2002»
15 years 6 months ago
Complexity of Mechanism Design
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism de...
Vincent Conitzer, Tuomas Sandholm
APAL
2007
111views more  APAL 2007»
15 years 6 months ago
A coverage construction of the reals and the irrationals
I modify the standard coverage construction of the reals to obtain the irrationals. However, this causes a jump in ordinal complexity from ω + 1 to Ω. The coverage technique ha...
Harold Simmons
IJRR
2002
105views more  IJRR 2002»
15 years 6 months ago
Computing Wrench Cones for Planar Rigid Body Contact Tasks
The contribution of this paper is the expansion of the range of possibilities in the analysis, planning, and control of contact tasks. The successful execution of any contact task...
Devin J. Balkcom, Jeffrey C. Trinkle
STOC
2003
ACM
114views Algorithms» more  STOC 2003»
16 years 7 months ago
Testing subgraphs in directed graphs
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
Noga Alon, Asaf Shapira
PODS
2012
ACM
281views Database» more  PODS 2012»
13 years 9 months ago
Mergeable summaries
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...
Pankaj K. Agarwal, Graham Cormode, Zengfeng Huang,...