Sciweavers

296 search results - page 35 / 60
» Group connectivity of certain graphs
Sort
View
90
Voted
COR
2010
146views more  COR 2010»
14 years 9 months ago
A search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
PAKDD
2010
ACM
117views Data Mining» more  PAKDD 2010»
15 years 2 months ago
BASSET: Scalable Gateway Finder in Large Graphs
Given a social network, who is the best person to introduce you to, say, Chris Ferguson, the poker champion? Or, given a network of people and skills, who is the best person to he...
Hanghang Tong, Spiros Papadimitriou, Christos Falo...
AUTOMATICA
2010
130views more  AUTOMATICA 2010»
14 years 9 months ago
Discrete-time dynamic average consensus
We propose a class of discrete-time dynamic average consensus algorithms that allow a group of agents to track the average of their reference inputs. The convergence results rely ...
Minghui Zhu, Sonia Martínez
IJCAI
2007
14 years 11 months ago
Web Page Clustering Using Heuristic Search in the Web Graph
Effective representation of Web search results remains an open problem in the Information Retrieval community. For ambiguous queries, a traditional approach is to organize search ...
Ron Bekkerman, Shlomo Zilberstein, James Allan
ICDCSW
2007
IEEE
15 years 4 months ago
Object-Swapping for Resource-Constrained Devices
Mobile devices are still memory-constrained when compared to desktop and laptop computers. Thus, in some circumstances, even while occupied by useful objects, some memory must be ...
Luís Veiga, Paulo Ferreira