1433 search results - page 108 / 287 » On Covering Problems of Rado |
176
click to vote
IJWIN
2006
15 years 6 months ago
2006
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...
174
click to vote
NPL
1998
15 years 6 months ago
1998
A new architecture and method for feature selection and extraction of logical rules from neural networks trained with backpropagation algorithm is presented. The network consists ...
172
click to vote
MP
2010
15 years 4 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...
147
click to vote
ICALT
2006
IEEE
16 years 12 days 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...
125
click to vote
AIPS
2008
15 years 8 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...