Sciweavers

1983 search results - page 113 / 397
» Competitive graph searches
Sort
View
LATIN
2004
Springer
14 years 1 months ago
Embracing the Giant Component
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
EVOW
2004
Springer
14 years 1 months ago
A Hierarchical Social Metaheuristic for the Max-Cut Problem
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
Abraham Duarte, Felipe Fernández, Án...
AAAI
2007
13 years 10 months ago
Best-First Search for Treewidth
Finding the exact treewidth of a graph is central to many operations in a variety of areas, including probabilistic reasoning and constraint satisfaction. Treewidth can be found b...
P. Alex Dow, Richard E. Korf
HPCC
2005
Springer
14 years 1 months ago
A Loop-Aware Search Strategy for Automated Performance Analysis
Abstract. Automated online search is a powerful technique for performance diagnosis. Such a search can change the types of experiments it performs while the program is running, mak...
Eli D. Collins, Barton P. Miller
WWW
2007
ACM
14 years 8 months ago
Dynamic personalized pagerank in entity-relation graphs
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
Soumen Chakrabarti