663 search results - page 87 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
TWC
2010
13 years 2 months ago
2010
In this paper, we consider a wireless communication scenario with multiple source-destination pairs communicating through several cooperative amplify-and-forward relay terminals. T...
ICANN
2005
Springer
14 years 1 months ago
2005
Springer
One aim of Meta-learning techniques is to minimize the time needed for problem solving, and the effort of parameter hand-tuning, by automating algorithm selection. The predictive m...
ADHOCNOW
2009
Springer
14 years 2 months ago
2009
Springer
The aim of this paper is to design efficient gathering algorithms (data collection) in a Base Station of a wireless multi hop grid network when interferences constraints are presen...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
: The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints....
INFORMS
1998
13 years 7 months ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...