5316 search results - page 212 / 1064 » Which Search Problems Are Random |
145
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
166
click to vote
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from elli...
125
click to vote
ALGORITHMICA
2006
15 years 4 months ago
2006
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from ellip...
161
click to vote
SAC
2010
ACM
15 years 11 months ago
2010
ACM
This paper presents a random finite set theoretic formulation for multi-object tracking as perceived by a 3D-LIDAR in a dynamic environment. It is mainly concerned with the joint...
147
click to vote
CP
1997
Springer
15 years 8 months ago
1997
Springer
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...