Sciweavers

519 search results - page 62 / 104
» A New Approach to Strongly Polynomial Linear Programming
Sort
View
ATMOS
2010
183views Optimization» more  ATMOS 2010»
15 years 9 days ago
The Complexity of Integrating Routing Decisions in Public Transportation Models
To model and solve optimization problems arising in public transportation, data about the passengers is necessary and has to be included in the models in any phase of the planning...
Marie Schmidt, Anita Schöbel
CPAIOR
2009
Springer
15 years 8 months ago
Solution Enumeration for Projected Boolean Search Problems
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...
Martin Gebser, Benjamin Kaufmann, Torsten Schaub
STOC
1998
ACM
89views Algorithms» more  STOC 1998»
15 years 5 months ago
Minimizing Stall Time in Single and Parallel Disk Systems
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algor...
Susanne Albers, Naveen Garg, Stefano Leonardi
VLSID
2008
IEEE
153views VLSI» more  VLSID 2008»
16 years 1 months ago
Total Power Minimization in Glitch-Free CMOS Circuits Considering Process Variation
Compared to subthreshold leakage, dynamic power is normally much less sensitive to the process variation due to its approximately linear relation to the process parameters. Howeve...
Yuanlin Lu, Vishwani D. Agrawal
ECML
2007
Springer
15 years 7 months ago
Discriminative Sequence Labeling by Z-Score Optimization
Abstract. We consider a new discriminative learning approach to sequence labeling based on the statistical concept of the Z-score. Given a training set of pairs of hidden-observed ...
Elisa Ricci, Tijl De Bie, Nello Cristianini