Sciweavers

1650 search results - page 158 / 330
» The HOM problem is decidable
Sort
View
EOR
2007
69views more  EOR 2007»
15 years 4 months ago
Incorporating inventory and routing costs in strategic location models
We consider a supply chain design problem where the decision maker needs to decide the number and locations of the distribution centers (DCs). Customers face random demand, and ea...
Zuo-Jun Max Shen, Lian Qi
JCSS
2000
71views more  JCSS 2000»
15 years 4 months ago
Path Constraints in Semistructured Databases
We investigate a class of path constraints that is of interest in connection with both semistructured and structured data. In standard database systems, constraints are typically ...
Peter Buneman, Wenfei Fan, Scott Weinstein
IEICET
2007
90views more  IEICET 2007»
15 years 4 months ago
Multi-Point Simulated Annealing with Adaptive Neighborhood
—When SA is applied to continuous optimization problems, the design of the neighborhood used in SA becomes important. A lot of experiments are necessary to determine an appropria...
Keiko Ando, Mitsunori Miki, Tomoyuki Hiroyasu
CPAIOR
2011
Springer
14 years 8 months ago
Almost Square Packing
Abstract. The almost square rectangle packing problem involves packing all rectangles with sizes 1 × 2 to n × (n + 1) (almost squares) into an enclosing rectangle of minimal area...
Helmut Simonis, Barry O'Sullivan
CAV
2005
Springer
150views Hardware» more  CAV 2005»
15 years 10 months ago
Reasoning About Threads Communicating via Locks
Abstract. We propose a new technique for the static analysis of concurrent programs comprised of multiple threads. In general, the problem is known to be undecidable even for progr...
Vineet Kahlon, Franjo Ivancic, Aarti Gupta