Sciweavers

2474 search results - page 139 / 495
» Solving Problems on Parallel Computers by Cellular Programmi...
Sort
View
MFCS
2009
Springer
15 years 11 months ago
Branching Programs for Tree Evaluation
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
DIS
2010
Springer
15 years 3 months ago
Sparse Substring Pattern Set Discovery Using Linear Programming Boosting
In this paper, we consider finding a small set of substring patterns which classifies the given documents well. We formulate the problem as 1 norm soft margin optimization problem ...
Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Mas...
136
Voted
ICCS
2005
Springer
15 years 10 months ago
Dynamic Memory Management in the Loci Framework
Abstract. Resource management is a critical concern in high-performance computing software. While management of processing resources to increase performance is the most critical, e...
Yang Zhang, Edward A. Luke
INFORMS
2010
100views more  INFORMS 2010»
15 years 2 months ago
Two-Step MIR Inequalities for Mixed Integer Programs
Two-step MIR inequalities are valid inequalities derived from a facet of a simple mixedinteger set with three variables and one constraint. In this paper we investigate how to eff...
Sanjeeb Dash, Marcos Goycoolea, Oktay Günl&uu...
127
Voted
IPPS
2009
IEEE
15 years 11 months ago
On the complexity of mapping pipelined filtering services on heterogeneous platforms
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
Anne Benoit, Fanny Dufossé, Yves Robert