406 search results - page 43 / 82 » Pseudorandomness and Combinatorial Constructions |
PPSN
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
SBIA
2010
Springer
13 years 9 months ago
2010
Springer
Most of modern constraint modeling languages combine rich constraint languages with mathematical notations to tackle combinatorial optimization problems. Our purpose is to introduc...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
ECCC
2011
13 years 6 months ago
2011
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
IROS
2007
IEEE
14 years 5 months ago
2007
IEEE
— For the design of an automated transportation system in an actual seaport container terminal, it is necessary to take into consideration the maintenance of operating robots (AG...