16596 search results - page 357 / 3320 » Generalized Assignment Problems |
278
click to vote
COMPGEOM
2010
ACM
16 years 14 days ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
213
click to vote
ICCAD
2009
IEEE
15 years 5 months ago
2009
IEEE
With increasing process variation, binning has become an important technique to improve the values of fabricated chips, especially in high performance microprocessors where transpa...
157
click to vote
IPL
2000
15 years 7 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...
193
click to vote
CDC
2010
IEEE
15 years 2 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...
202
click to vote
ATAL
2009
Springer
16 years 2 months ago
2009
Springer
Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...