Sciweavers

2393 search results - page 196 / 479
» Bounds-Consistent Local Search
Sort
View
110
Voted
CN
2000
96views more  CN 2000»
15 years 3 months ago
Focused Web searching with PDAs
The Stanford Power Browser project addresses the problems of interacting with the World-Wide Web through wirelessly connected Personal Digital Assistants (PDAs). These problems in...
Orkut Buyukkokten, Hector Garcia-Molina, Andreas P...
EMO
2009
Springer
219views Optimization» more  EMO 2009»
15 years 10 months ago
An Elitist GRASP Metaheuristic for the Multi-objective Quadratic Assignment Problem
We propose an elitist Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic algorithm, called mGRASP/MH, for approximating the Pareto-optimal front in the multi-objecti...
Hui Li, Dario Landa Silva
131
Voted
WWW
2004
ACM
16 years 4 months ago
Small world peer networks in distributed web search
In ongoing research, a collaborative peer network application is being proposed to address the scalability limitations of centralized search engines. Here we introduce a local ada...
Ruj Akavipat, Le-Shin Wu, Filippo Menczer
136
Voted
SAT
2009
Springer
132views Hardware» more  SAT 2009»
15 years 10 months ago
Relaxed DPLL Search for MaxSAT
We propose a new incomplete algorithm for the Maximum Satisfiability (MaxSAT) problem on unweighted Boolean formulas, focused specifically on instances for which proving unsatis...
Lukas Kroc, Ashish Sabharwal, Bart Selman
ECAI
2004
Springer
15 years 8 months ago
On-Line Search for Solving Markov Decision Processes via Heuristic Sampling
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
Laurent Péret, Frédérick Garc...