Sciweavers

70 search results - page 5 / 14
» An exploration of ranking heuristics in mobile local search
Sort
View
CONSTRAINTS
2007
46views more  CONSTRAINTS 2007»
13 years 7 months ago
Local-search Extraction of MUSes
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
Éric Grégoire, Bertrand Mazure, C&ea...
WEA
2004
Springer
128views Algorithms» more  WEA 2004»
14 years 24 days ago
GRASP with Path-Relinking for the Quadratic Assignment Problem
This paper describes a GRASP with path-relinking heuristic for the quadratic assignment problem. GRASP is a multi-start procedure, where different points in the search space are p...
Carlos A. S. Oliveira, Panos M. Pardalos, Mauricio...
EVOW
2011
Springer
12 years 11 months ago
Local Search for Mixed-Integer Nonlinear Optimization: A Methodology and an Application
Abstract. A methodology is presented for tackling mixed-integer nonlinear optimization problems by local search, in particular large-scale real-life problems. This methodology is i...
Frédéric Gardi, Karim Nouioua
SIGIR
2009
ACM
14 years 2 months ago
Good abandonment in mobile and PC internet search
Query abandonment by search engine users is generally considered to be a negative signal. In this paper, we explore the concept of good abandonment. We define a good abandonment ...
Jane Li, Scott B. Huffman, Akihito Tokuda
AAAI
2007
13 years 9 months ago
Topological Mapping with Weak Sensory Data
In this paper, we consider the exploration of topological environments by a robot with weak sensory capabilities. We assume only that the robot can recognize when it has reached a...
Gregory Dudek, Dimitri Marinakis