14161 search results - page 289 / 2833 » On generalized middle-level problem |
143
click to vote
SAC
2005
ACM
16 years 5 days ago
2005
ACM
This paper addresses single and multiple container loading problems. We propose to use dynamic prioritization to handle awkward box types. The box type with a higher priority will...
157
click to vote
CEEMAS
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. Distributed Constraint Satisfaction Problems (DCSP) is a general framework for multi-agent coordination and conflict resolution. In most DCSP algorithms, inter-agent com...
161
click to vote
ESA
2004
Springer
16 years 3 hour ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
188
click to vote
ESA
2004
Springer
16 years 3 hour ago
2004
Springer
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
174
click to vote
ICNP
2002
IEEE
15 years 11 months ago
2002
IEEE
The Multi Exit Discriminator (MED) attribute of the Border Gateway Protocol (BGP) is widely used to implement “cold potato routing” between autonomous systems. However, the us...