144 search results - page 11 / 29 » New approaches to covering and packing problems |
IWPEC
2004
Springer
15 years 3 months ago
2004
Springer
Based on a series of known and new examples, we propose the generalized setting of “distance from triviality” measurement as a reasonable and prospective way of determining use...
TAP
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. Usage of combinatorial testing is wide spreading as an effective technique to reveal unintended feature interaction inside a given system. To this aim, test cases are con...
EOR
2010
14 years 7 months ago
2010
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
163
click to vote
VLDB
2001
ACM
15 years 9 months ago
2001
ACM
Schema matching is a basic problem in many database application domains, such as data integration, Ebusiness, data warehousing, and semantic query processing. In current implementa...
73
Voted
MMB
1999
Springer
15 years 1 months ago
1999
Springer
Auctions are a widely used approach for determining the current market price for congested resources. However, using them for real systems, such as the Internet, the auction algor...