Sciweavers

6582 search results - page 119 / 1317
» The focus of attention problem
Sort
View
WG
2010
Springer
15 years 4 months ago
Parameterized Complexity of the Arc-Preserving Subsequence Problem
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
Dániel Marx, Ildikó Schlotter
SIAMJO
2010
128views more  SIAMJO 2010»
15 years 1 months ago
Solving Log-Determinant Optimization Problems by a Newton-CG Primal Proximal Point Algorithm
We propose a Newton-CG primal proximal point algorithm for solving large scale log-determinant optimization problems. Our algorithm employs the essential ideas of the proximal poi...
Chengjing Wang, Defeng Sun, Kim-Chuan Toh
LATA
2010
Springer
16 years 1 months ago
Choosing Word Occurrences for the Smallest Grammar Problem
The smallest grammar problem - namely, finding a smallest context-free grammar that generates exactly one sequence - is of practical and theoretical importance in fields such as ...
Rafael Carrascosa, François Coste, Matthias...
CEC
2005
IEEE
16 years 2 days ago
Dynamic power minimization during combinational circuit testing as a traveling salesman problem
Testing of VLSI circuits can cause generation of excessive heat which can damage the chips under test. In the random testing environment, high-performance CMOS circuits consume sig...
Artem Sokolov, Alodeep Sanyal, L. Darrell Whitley,...
ESA
2007
Springer
122views Algorithms» more  ESA 2007»
15 years 10 months ago
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem
Abstract. In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheles...
Cristina Bazgan, Hadrien Hugot, Daniel Vanderpoote...