Sciweavers

257 search results - page 11 / 52
» A (Somewhat) New Solution to the Variable Binding Problem
Sort
View
EOR
2010
110views more  EOR 2010»
14 years 9 months ago
A hybrid metaheuristic approach to solving the UBQP problem
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
Zhipeng Lü, Fred Glover, Jin-Kao Hao
ATAL
2010
Springer
14 years 10 months ago
A quantified distributed constraint optimization problem
In this paper, we propose a Quantified Distributed Constraint Optimization problem (QDCOP) that extends the framework of Distributed Constraint Optimization problems (DCOPs). DCOP...
Toshihiro Matsui, Hiroshi Matsuo, Marius-Calin Sil...
SSDBM
2006
IEEE
129views Database» more  SSDBM 2006»
15 years 3 months ago
Indexing Time-Evolving Data With Variable Lifetimes
Many applicationsstore data items for a pre-determined, finite length of time. Examples include slidingwindows over on-line data streams, where old data are dropped as the window...
Lukasz Golab, Piyush Prahladka, M. Tamer Özsu
WSC
2008
14 years 12 months ago
SR-1: A simulation-based algorithm for the Capacitated Vehicle Routing Problem
In this paper we present SR-1, a simulation-based heuristic algorithm for the Capacitated Vehicle Routing Problem (CVRP). Given a CVRP instance, SR-1 uses an initial "good so...
Javier Faulin, Miquel Gilibert, Angel A. Juan, Xav...
IJCAI
1993
14 years 11 months ago
Using Inferred Disjunctive Constraints To Decompose Constraint Satisfaction Problems
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many...
Eugene C. Freuder, Paul D. Hubbe