Sciweavers

565 search results - page 89 / 113
» Heuristics for Planning with SAT
Sort
View
ECAI
2008
Springer
13 years 9 months ago
Multi-valued Pattern Databases
Pattern Databases were a major breakthrough in heuristic search by solving hard combinatorial problems various orders of magnitude faster than state-of-the-art techniques at that ...
Carlos Linares López
PUK
2001
13 years 9 months ago
Realizing a Global Hyperpolyhedron Constraint via LP Techniques
Combination of AI/OR methods is gaining a great deal of attention because many combinatorial problems especially in planning and scheduling areas can be solved by means of combined...
Miguel A. Salido, Adriana Giret, Federico Barber
EOR
2008
95views more  EOR 2008»
13 years 8 months ago
Augmenting the lot sizing order quantity when demand is probabilistic
In this paper we consider a single item, discrete time, lot sizing situation where demand is random and its parameters (e.g., mean and standard deviation) can change with time. Fo...
I. Nyoman Pujawan, Edward A. Silver
DAM
2006
83views more  DAM 2006»
13 years 8 months ago
Scheduling workover rigs for onshore oil production
Many oil wells in Brazilian onshore fields rely on artificial lift methods. Maintenance services such as cleaning, reinstatement, stimulation and others are essential to these wel...
Dario J. Aloise, Daniel Aloise, Caroline T. M. Roc...
VTC
2010
IEEE
138views Communications» more  VTC 2010»
13 years 6 months ago
Resource Allocation Scheme for Minimizing Uplink Interference in Hierarchical Cellular Networks
—Hierarchical cellular networks (HCNs), in which femtocells are deployed in the coverage of a conventional macrocell, offer a cost effective solution to achieve high user capacit...
Sung-Yeop Pyun, Dong-Ho Cho