511 search results - page 93 / 103 » Using Combinatorial Optimization Methods for Quantification ... |
WSC
2007
14 years 12 months ago
2007
Typically, IT projects are delivered over-budget and behind schedule. In this paper, we explore the effects of common project management practices that contribute to these problem...
VLDB
1998
ACM
15 years 1 months ago
1998
ACM
Oracle Materialized Views (MVs) are designed for data warehousing and replication. For data warehousing, MVs based on inner/outer equijoins with optional aggregation, can be refre...
IPPS
1997
IEEE
15 years 1 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
ICCS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Network coding is a method that promises to achieve the min-cut capacity in multicasts. However, pushing towards this gain in throughput comes with two sacrifices. Delay suffer...