Sciweavers

1933 search results - page 236 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
IPCO
2007
98views Optimization» more  IPCO 2007»
15 years 5 months ago
Scheduling with Precedence Constraints of Low Fractional Dimension
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
Christoph Ambühl, Monaldo Mastrolilli, Nikola...
JMLR
2012
13 years 6 months ago
A General Framework for Structured Sparsity via Proximal Optimization
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
Luca Baldassarre, Jean Morales, Andreas Argyriou, ...
ECAI
2010
Springer
15 years 4 months ago
Mining Outliers with Adaptive Cutoff Update and Space Utilization (RACAS)
Recently the efficiency of an outlier detection algorithm ORCA was improved by RCS (Randomization with faster Cutoff update and Space utilization after pruning), which changes the ...
Chi-Cheong Szeto, Edward Hung
JCT
1998
99views more  JCT 1998»
15 years 3 months ago
From Hall's Matching Theorem to Optimal Routing on Hypercubes
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...
Shuhong Gao, Beth Novick, Ke Qiu
CEC
2009
IEEE
15 years 10 months ago
Evolutionary programming with ensemble of explicit memories for dynamic optimization
—This paper presents the evolutionary programming with an ensemble of memories to deal with optimization problems in dynamic environments. The proposed algorithm modifies a recen...
Ling Yu, Ponnuthurai N. Suganthan