1566 search results - page 127 / 314 » On a Cone Covering Problem |
151
click to vote
BIS
2006
15 years 7 months ago
2006
In this paper we discuss the possible application of new concepts in web content extraction: utility assessment, utility annealing, and dynamic aggregated document generation. Aft...
185
click to vote
NCI
2004
15 years 7 months ago
2004
This paper describes a method for hierarchical reinforcement learning in which high-level policies automatically discover subgoals, and low-level policies learn to specialize for ...
177
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 ...
175
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...