2109 search results - page 310 / 422 » Solving Necklace Constraint Problems |
127
click to vote
CCE
2004
15 years 4 months ago
2004
The problem addressed in this work is to develop a comprehensive mathematical programming model for the efficient scheduling of oil-refinery operations. Our approach is first to d...
134
click to vote
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
We study the problem of finding the least-priced path (LPP) between a source and a destination in opportunistic spectrum access (OSA) networks. This problem is motivated by econo...
145
click to vote
CSCLP
2004
Springer
15 years 10 months ago
2004
Springer
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...
164
click to vote
FOCS
1998
IEEE
15 years 8 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
148
click to vote
ISPD
2000
ACM
15 years 9 months ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...