Sciweavers

11 search results - page 1 / 3
» ACOhg: dealing with huge graphs
Sort
View
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
13 years 9 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano
GECCO
2007
Springer
215views Optimization» more  GECCO 2007»
13 years 7 months ago
Finding safety errors with ACO
Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulae on the program variables. Most model checke...
Enrique Alba, J. Francisco Chicano
ICASSP
2010
IEEE
13 years 2 months ago
Random attributed graphs for statistical inference from content and context
Coping with Information Overload is a major challenge of the 21st century. Huge volumes and varieties of multilingual data must be processed to extract salient information. Previo...
Allen L. Gorin, Carey E. Priebe, John Grothendieck
SEMWEB
2009
Springer
13 years 10 months ago
Analysis of a Real Online Social Network Using Semantic Web Frameworks
Abstract. Social Network Analysis (SNA) provides graph algorithms to characterize the structure of social networks, strategic positions in these networks, specific sub-networks and...
Guillaume Erétéo, Michel Buffa, Fabi...
WWW
2004
ACM
14 years 4 months ago
Towards the composition of Ad Hoc B2B Applications: Semantics, Properties and Complexity Management
The goal is to build a general framework for ad hoc applications over large networks using semantics and complex systems analysis. The first part deals with semantics because appl...
Jaime Delgado, Rosa Gil, Zièd Choukair