3367 search results - page 211 / 674 » Incremental assignment problem |
111
Voted
IPL
2000
15 years 3 months ago
2000
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
136
Voted
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
This paper studies the connectivity maintenance problem in linear and nonlinear cyclic pursuit, when different control gains are assigned to each agent. Feasibility/infeasibility c...
125
Voted
COMPGEOM
2006
ACM
15 years 7 months ago
2006
ACM
We prove that any collection of n discs in which each one intersects at most k others, can be colored with at most O(log3 k) colors so that for each point p in the union of all di...
115
Voted
COMCOM
2006
15 years 3 months ago
2006
In this paper, we focus our attention on the problem of assigning initial secrets to users in ad-hoc network (respectively, sensors in a sensor network) so that they can use those...
114
Voted
ACL
2010
15 years 1 months ago
2010
We consider the search for a maximum likelihood assignment of hidden derivations and grammar weights for a probabilistic context-free grammar, the problem approximately solved by ...