Sciweavers

291 search results - page 47 / 59
» Constraint Satisfaction: The Approximability of Minimization...
Sort
View
INFORMS
1998
100views more  INFORMS 1998»
13 years 7 months ago
Feature Selection via Mathematical Programming
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...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
14 years 1 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
INFOCOM
2010
IEEE
13 years 6 months ago
MIMO-Aware Routing in Wireless Mesh Networks
Abstract—Multiple-input and multiple-output (MIMO) technique is considered as one of the most promising emerging wireless technologies that can significantly improve transmissio...
Shan Chu, Xin Wang
PDP
2005
IEEE
14 years 1 months ago
Independent and Divisible Tasks Scheduling on Heterogeneous Star-shaped Platforms with Limited Memory
In this paper, we consider the problem of allocating and scheduling a collection of independent, equal-sized tasks on heterogeneous star-shaped platforms. We also address the same...
Olivier Beaumont, Arnaud Legrand, Loris Marchal, Y...
SARA
2009
Springer
14 years 6 days ago
Light Algorithms for Maintaining Max-RPC During Search
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
Julien Vion, Romuald Debruyne