4110 search results - page 111 / 822 » Efficient algorithms for the 2-gathering problem |
124
click to vote
AAAI
1998
15 years 5 months ago
1998
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
142
click to vote
CCE
2004
15 years 4 months ago
2004
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
127
click to vote
ICA
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In this paper, we consider the Independent Component Analysis problem when the hidden sources are non-negative (Non-negative ICA). This problem is formulated as a non-lin...
162
click to vote
EDBT
2009
ACM
15 years 8 months ago
2009
ACM
Given a set of n query points in a general metric space, a metricspace skyline (MSS) query asks what are the closest points to all these query points in the database. Here, consid...
145
click to vote
AAAI
2010
15 years 5 months ago
2010
Many problems require repeated inference on probabilistic graphical models, with different values for evidence variables or other changes. Examples of such problems include utilit...