Sciweavers

3134 search results - page 502 / 627
» Computing full disjunctions
Sort
View
HPDC
2010
IEEE
13 years 11 months ago
Performance analysis of dynamic workflow scheduling in multicluster grids
Scientists increasingly rely on the execution of workflows in grids to obtain results from complex mixtures of applications. However, the inherently dynamic nature of grid workflo...
Omer Ozan Sonmez, Nezih Yigitbasi, Saeid Abrishami...
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
13 years 11 months ago
Evolutionary swarm design of architectural idea models
In this paper we present a swarm grammar system that makes use of bio-inspired mechanisms of reproduction, communication and construction in order to build three-dimensional struc...
Sebastian von Mammen, Christian Jacob
GECCO
2008
Springer
196views Optimization» more  GECCO 2008»
13 years 11 months ago
ADANN: automatic design of artificial neural networks
In this work an improvement of an initial approach to design Artificial Neural Networks to forecast Time Series is tackled, and the automatic process to design Artificial Neural N...
Juan Peralta, Germán Gutiérrez, Arac...
GIS
2008
ACM
13 years 11 months ago
Heuristic algorithms for route-search queries over geographical data
In a geographical route search, given search terms, the goal is to find an effective route that (1) starts at a given location, (2) ends at a given location, and (3) travels via...
Yaron Kanza, Eliyahu Safra, Yehoshua Sagiv, Yerach...
CCS
2010
ACM
13 years 10 months ago
In search of an anonymous and secure lookup: attacks on structured peer-to-peer anonymous communication systems
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...
Qiyan Wang, Prateek Mittal, Nikita Borisov