1424 search results - page 99 / 285 » The Multi-radius Cover Problem |
125
click to vote
MP
2010
15 years 1 months ago
2010
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
103
click to vote
TRIDENTCOM
2010
IEEE
15 years 26 days ago
2010
IEEE
Prototyping future Internet technologies is an important but complicated task, mainly caused by incompatibilities to existing systems and high implementation complexity. To reduce ...
153
click to vote
IGARSS
2009
15 years 22 days ago
2009
Automated classification of land cover types based on hyperspectral imagery often involves a large geographical area, but class labels are available for only small portions of the...
102
click to vote
ICALT
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper, we present our research results about a UML-based modeling language dedicated to Problem-Based Learning design. The CPM (Cooperative Problem-Based learning Metamode...
AIPS
2008
15 years 5 months ago
2008
We present a complex scheduling problem where we want to plan meetings between customers and exhibitors at a trade event. One cause of the complexity of the problem is the general...