Sciweavers

3223 search results - page 171 / 645
» The Scaling of Search Cost
Sort
View
PATAT
2004
Springer
141views Education» more  PATAT 2004»
15 years 12 months ago
A Hybrid Multi-objective Evolutionary Algorithm for the Uncapacitated Exam Proximity Problem
A hybrid Multi-Objective Evolutionary Algorithm is used to tackle the uncapacitated exam proximity problem. In this hybridization, local search operators are used instead of the tr...
Pascal Côté, Tony Wong, Robert Sabour...
TEC
2002
163views more  TEC 2002»
15 years 6 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
CVPR
2010
IEEE
16 years 3 months ago
Aggregating local descriptors into a compact image representation
We address the problem of image search on a very large scale, where three constraints have to be considered jointly: the accuracy of the search, its efficiency, and the memory usag...
Hervé Jégou, Matthijs Douze, Cordelia Schmid and...
KBSE
2002
IEEE
15 years 11 months ago
What Makes Finite-State Models More (or Less) Testable?
Finite-state machine (FSM) models are commonly used to represent software with concurrent processes. Established model checking tools can be used to automatically test FSM models,...
David Owen, Tim Menzies, Bojan Cukic
MICRO
2003
IEEE
108views Hardware» more  MICRO 2003»
15 years 11 months ago
Reducing Design Complexity of the Load/Store Queue
With faster CPU clocks and wider pipelines, all relevant microarchitecture components should scale accordingly. There have been many proposals for scaling the issue queue, registe...
Il Park, Chong-liang Ooi, T. N. Vijaykumar