6562 search results - page 186 / 1313 » Noetherianity and Combination Problems |
198
click to vote
APPROX
2004
Springer
15 years 12 months ago
2004
Springer
We consider a single-source network design problem from a game-theoretic perspective. Gupta, Kumar and Roughgarden (Proc. 35th Annual ACM STOC, pages 365–372, 2003) developed a ...
172
click to vote
WSC
2008
15 years 8 months ago
2008
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
178
click to vote
ICSE
2009
IEEE-ACM
16 years 1 months ago
2009
IEEE-ACM
Determining whether a set of features can be composed, or safe composition, is a hard problem in software product line engineering because the number of feature combinations can b...
144
click to vote
ISCAS
2006
IEEE
16 years 15 days ago
2006
IEEE
- The novel CORDIC-based architecture of the these weights (combiner unit). The implementation of the Triangular Systolic Array for QRD of large size complex combiner unit is rathe...
173
click to vote
TAP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We consider the problem of test generation for Boolean combinational circuits. We use a novel approach based on the idea of treating tests as a proof encoding rather than...