4047 search results - page 141 / 810 » Some Properties and Some Problems on Set Functors |
134
click to vote
AAAI
2004
15 years 6 months ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
165
click to vote
WEA
2010
Springer
15 years 11 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
143
click to vote
ICRA
2009
IEEE
15 years 11 months ago
2009
IEEE
— In this paper, we propose a path planning method for nonholonomic multi-vehicle system in presence of moving obstacles. The objective is to find multiple fixed length paths f...
143
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
117
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....