3007 search results - page 287 / 602 » Linear Functional Fixed-points |
152
click to vote
COCOA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
143
click to vote
SAT
2007
Springer
15 years 10 months ago
2007
Springer
Integer Linear Programs are widely used in areas such as routing problems, scheduling analysis and optimization, logic synthesis, and partitioning problems. As many of these proble...
175
click to vote
ISPAN
2002
IEEE
15 years 9 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
140
click to vote
WINE
2009
Springer
15 years 8 months ago
2009
Springer
We consider the complexity of decision making with regards to predatory pricing in multimarket oligopoly models. Specifically, we present multimarket extensions of the classical s...
139
click to vote
VLDB
1998
ACM
15 years 8 months ago
1998
ACM
Query optimizers normally compile queries into one optimal plan by assuming complete knowledge of all cost parameters such asselectivity and resourceavailability. The execution of...