Sciweavers

543 search results - page 32 / 109
» A Multiagent Algorithm for Graph Partitioning
Sort
View
145
Voted
ANTSW
2010
Springer
14 years 10 months ago
Autonomous Multi-agent Cycle Based Patrolling
We introduce a novel multi-agent patrolling strategy. By assumption, the swarm of agents performing the task consists of very low capability ant-like agents. The agents have littl...
Yotam Elor, Alfred M. Bruckstein
ICALP
2009
Springer
16 years 25 days ago
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
118
Voted
GECCO
2008
Springer
140views Optimization» more  GECCO 2008»
15 years 1 months ago
A bivariate probabilistic model-building genetic algorithm for graph bipartitioning
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
Dirk Thierens
83
Voted
IPPS
2006
IEEE
15 years 6 months ago
Parallelizing post-placement timing optimization
This paper presents an efficient modeling scheme and a partitioning heuristic for parallelizing VLSI post-placement timing optimization. Encoding the paths with timing violations...
Jiyoun Kim, Marios C. Papaefthymiou, José N...
86
Voted
ALT
2009
Springer
15 years 9 months ago
Learning Unknown Graphs
Motivated by a problem of targeted advertising in social networks, we introduce and study a new model of online learning on labeled graphs where the graph is initially unknown and...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...