4266 search results - page 318 / 854 » The container loading problem |
139
click to vote
STOC
2005
ACM
16 years 5 months ago
2005
ACM
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...
234
click to vote
SIGMOD
2009
ACM
16 years 5 months ago
2009
ACM
Existing works in XML keyword search have addressed the problem of finding matching results of a query. However, user input queries always contain irrelevant or mismatched terms, ...
125
click to vote
STACS
2010
Springer
15 years 12 months ago
2010
Springer
Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems including Minimum Fill-i...
154
click to vote
SAC
2010
ACM
15 years 11 months ago
2010
ACM
Analysis of systems containing both discrete and continuous dynamics, hybrid systems, is a difficult issue. Most problems have been shown to be undecidable in general, and decidab...
148
Voted
ICFCA
2010
Springer
15 years 11 months ago
2010
Springer
We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents det...