1291 search results - page 197 / 259 » Computing the multiplicity structure in solving polynomial s... |
ATAL
2004
Springer
15 years 7 months ago
2004
Springer
Decision-theoretic models have become increasingly popular as a basis for solving agent and multiagent problems, due to their ability to quantify the complex uncertainty and prefe...
113
click to vote
IWOMP
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Exploiting the full computational power of current hierarchical multiprocessor machines requires a very careful distribution of threads and data among the underlying non-...
121
click to vote
IPCO
2008
15 years 3 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
115
click to vote
VC
2011
14 years 8 months ago
2011
Despite the ability of current GPU processors to treat heavy parallel computation tasks, its use for solving medical image segmentation problems is still not fully exploited and re...
123
click to vote
MICCAI
2008
Springer
16 years 2 months ago
2008
Springer
We propose a method that computes a conformal mapping from a multiply connected mesh to the so-called slit domain, which consists of a canonical rectangle or disk in which 3D curve...