Sciweavers

2880 search results - page 257 / 576
» Approximate Range Searching
Sort
View
CP
2004
Springer
15 years 9 months ago
The Tractability of Global Constraints
Abstract. Constraint propagation is one of the techniques central to the success of constraint programming. Fast algorithms are used to prune the search space either before or duri...
Christian Bessière, Emmanuel Hebrard, Brahi...
WEA
2004
Springer
120views Algorithms» more  WEA 2004»
15 years 9 months ago
An Improved Time-Sensitive Metaheuristic Framework for Combinatorial Optimization
We introduce a metaheuristic framework for combinatorial optimization. Our framework is similar to others (e.g. [1]) in that it is modular enough that important components can be i...
Vinhthuy T. Phan, Steven Skiena
CAISE
2006
Springer
15 years 7 months ago
Capability Management and Discovery in Description Logic
In some application domains as composite software, ranging from search engines, to more general applications, like cooperative and distributed applications or e-business and e-comm...
Dong Cheng, Nacer Boudjlida
GECCO
2000
Springer
150views Optimization» more  GECCO 2000»
15 years 7 months ago
A Hybrid Genetic Algorithm for the Quadratic Assignment Problem
A heuristic technique that combines a genetic algorithm with a Tabu Search algorithm is applied to the Quadratic Assignment Problem (QAP). The hybrid algorithm improves the result...
Manuel Vázquez, L. Darrell Whitley
DELOS
2001
15 years 5 months ago
Client Side Personalization
We describe an approach to personalization that emphasizes the "client side." We posit the need for a highly individualistic user context that resides on the client mach...
Lillian N. Cassel, Ursula Wolz