Sciweavers

3044 search results - page 177 / 609
» Linear logical approximations
Sort
View
ENDM
2010
136views more  ENDM 2010»
13 years 10 months ago
Approximating the asymmetric profitable tour
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
Viet Hung Nguyen, Thi Thu Thuy Nguyen
HEURISTICS
1998
103views more  HEURISTICS 1998»
13 years 10 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
MP
2002
84views more  MP 2002»
13 years 10 months ago
A decomposition procedure based on approximate Newton directions
The efficient solution of large-scale linear and nonlinear optimization problems may require exploiting any special structure in them in an efficient manner. We describe and analy...
Antonio J. Conejo, Francisco J. Nogales, Francisco...
NN
2010
Springer
187views Neural Networks» more  NN 2010»
13 years 5 months ago
Efficient exploration through active learning for value function approximation in reinforcement learning
Appropriately designing sampling policies is highly important for obtaining better control policies in reinforcement learning. In this paper, we first show that the least-squares ...
Takayuki Akiyama, Hirotaka Hachiya, Masashi Sugiya...
RSCTC
2000
Springer
147views Fuzzy Logic» more  RSCTC 2000»
14 years 1 months ago
Towards Rough Neural Computing Based on Rough Membership Functions: Theory and Application
This paper introduces a neural network architecture based on rough sets and rough membership functions. The neurons of such networks instantiate approximate reasoning in assessing ...
James F. Peters, Andrzej Skowron, Liting Han, Shee...