Sciweavers

8413 search results - page 195 / 1683
» Ordering Problem Subgoals
Sort
View
102
Voted
CL
2000
Springer
15 years 5 months ago
Modelling Digital Circuits Problems with Set Constraints
A number of diagnostic and optimisation problems in Electronics Computer Aided Design have usually been handled either by specific tools or by mapping them into a general problem s...
Francisco Azevedo, Pedro Barahona
68
Voted
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
15 years 2 months ago
An efficient algorithm for a class of fused lasso problems
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
Jun Liu, Lei Yuan, Jieping Ye
94
Voted
CCCG
2007
15 years 2 months ago
Generalized Watchman Route Problem with Discrete View Cost
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta
93
Voted
MIC
2003
116views Control Systems» more  MIC 2003»
15 years 2 months ago
On the Linear Quadratic Minimum-fuel Problem
E.I.Verriest and F.L.Lewis have presented in [1] a new method to approach the minimum-time control of linear continous-time systems avoiding the Bang-Bang control. Their method re...
H. Benazza, N. El Alami
94
Voted
IPL
2008
114views more  IPL 2008»
15 years 20 days ago
The online Prize-Collecting Traveling Salesman Problem
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura