Sciweavers

2612 search results - page 299 / 523
» Assemblies as Graph Processes
Sort
View
SLS
2009
Springer
250views Algorithms» more  SLS 2009»
16 years 1 months ago
Running Time Analysis of ACO Systems for Shortest Path Problems
Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO...
Christian Horoba, Dirk Sudholt
ECSA
2007
Springer
16 years 23 days ago
Architecture Migration Driven by Code Categorization
Abstract. In this paper, we report on the development of a methodology for the evolution of software towards new architectures. In our approach, we represent source code as graphs....
Rui Correia, Carlos M. P. Matos, Reiko Heckel, Moh...
ECTEL
2007
Springer
16 years 23 days ago
Adaptation of the ACO Heuristic for Sequencing Learning Activities
This paper describes an initiative aimed at adapting swarm intelligence techniques (in particular, Ant Colony Optimization) to an e-learning environment, thanks to the fact that th...
Sergio Gutiérrez Santos, Grégory Val...
ICALP
2007
Springer
16 years 22 days ago
On Commutativity Based Edge Lean Search
Exploring a graph through search is one of the most basic building blocks of various applications. In a setting with a huge state space, such as in testing and verification, optim...
Dragan Bosnacki, Edith Elkind, Blaise Genest, Doro...
ISI
2007
Springer
16 years 22 days ago
Organizing Hot-Spot Police Patrol Routes
—We address the problem of planning patrol routes to maximize coverage of important locations (hot spots) at minimum cost (length of patrol route). We model a road network using ...
Sudarshan S. Chawathe