Sciweavers

1434 search results - page 4 / 287
» Graph Searching with Advice
Sort
View
STACS
2010
Springer
14 years 2 months ago
Two-phase Algorithms for the Parametric Shortest Path Problem
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
Sourav Chakraborty, Eldar Fischer, Oded Lachish, R...
GECCO
2010
Springer
213views Optimization» more  GECCO 2010»
13 years 7 months ago
Consultant-guided search algorithms for the quadratic assignment problem
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
Serban Iordache
NETWORKS
2010
13 years 5 months ago
Mixed search number and linear-width of interval and split graphs
We show that the mixed search number and the linear-width of interval graphs and of split graphs can be computed in linear time and in polynomial time, respectively.
Fedor V. Fomin, Pinar Heggernes, Rodica Mihai
CHI
2004
ACM
14 years 27 days ago
Trust and mistrust of online health sites
Do different design and information content factors influence trust and mistrust of online health sites? Fifteen women faced with a risky health decision were observed while searc...
Elizabeth Sillence, Pamela Briggs, Lesley Fishwick...
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
13 years 11 months ago
Towards an Analysis of Local Optimization Algorithms
We introduce a variant of Aldous and Vazirani's \Go with the winners" algorithm that can be used for search graphs that are not trees. We analyze the algorithm in terms ...
Tassos Dimitriou, Russell Impagliazzo