Sciweavers

684 search results - page 63 / 137
» A multi-parametric programming approach for constrained dyna...
Sort
View
WEA
2010
Springer
300views Algorithms» more  WEA 2010»
14 years 3 months ago
Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
Charles Delort, Olivier Spanjaard
WCET
2010
13 years 6 months ago
Precomputing Memory Locations for Parametric Allocations
Current worst-case execution time (WCET) analyses do not support programs using dynamic memory allocation. This is mainly due to the unpredictability of cache performance introduc...
Jörg Herter, Sebastian Altmeyer
JMLR
2006
115views more  JMLR 2006»
13 years 8 months ago
Structured Prediction, Dual Extragradient and Bregman Projections
We present a simple and scalable algorithm for maximum-margin estimation of structured output models, including an important class of Markov networks and combinatorial models. We ...
Benjamin Taskar, Simon Lacoste-Julien, Michael I. ...
BCB
2010
156views Bioinformatics» more  BCB 2010»
13 years 3 months ago
Accelerating HMMER on GPUs by implementing hybrid data and task parallelism
Many biologically motivated problems are expressed as dynamic programming recurrences and are difficult to parallelize due to the intrinsic data dependencies in their algorithms. ...
Narayan Ganesan, Roger D. Chamberlain, Jeremy Buhl...
CN
2002
82views more  CN 2002»
13 years 8 months ago
Optimal allocation of electronic content
Abstract-The delivery of large files to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of...
Israel Cidon, Shay Kutten, Ran Soffer