4047 search results - page 723 / 810 » The Discrete Basis Problem |
114
Voted
ICCSA
2003
Springer
15 years 9 months ago
2003
Springer
A problem of eliminating the unwanted time-harmonic noise on a predetermined region of interest is solved by active means, i.e., by introducing the additional sources of sound, cal...
135
click to vote
SIGMOD
2010
ACM
15 years 8 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
164
Voted
SC
2009
ACM
15 years 8 months ago
2009
ACM
It has been shown that the sparse grid combination technique can be a practical tool to solve high dimensional PDEs arising in multidimensional option pricing problems in finance...
143
Voted
CCO
2001
Springer
15 years 8 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
144
Voted
ICCS
2001
Springer
15 years 8 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...