Sciweavers

6897 search results - page 1104 / 1380
» Parallelization of Modular Algorithms
Sort
View
ICDT
2009
ACM
121views Database» more  ICDT 2009»
16 years 7 months ago
Optimal splitters for database partitioning with size bounds
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (o...
Kenneth A. Ross, John Cieslewicz
RECOMB
2007
Springer
16 years 6 months ago
Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking
The study of biological networks and network motifs can yield significant new insights into systems biology. Previous methods of discovering network motifs ? network-centric subgra...
Joshua A. Grochow, Manolis Kellis
160
Voted
CADE
2006
Springer
16 years 6 months ago
Inferring Network Invariants Automatically
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
Olga Grinchtein, Martin Leucker, Nir Piterman
ICDCN
2009
Springer
16 years 1 months ago
Flooding-Assisted Threshold Assignment for Aggregate Monitoring in Sensor Networks
The research community has witnessed a large interest in monitoring large scale distributed systems. In these applications typically we wish to monitor a global system condition wh...
Ali Abbasi, Ahmad Khonsari, Mohammad Sadegh Talebi
176
Voted
CEC
2009
IEEE
16 years 1 months ago
Particle Swarm CMA Evolution Strategy for the optimization of multi-funnel landscapes
— We extend the Evolution Strategy with Covariance Matrix Adaptation (CMA-ES) by collaborative concepts from Particle Swarm Optimization (PSO). The proposed Particle Swarm CMA-ES...
Christian L. Müller, Benedikt Baumgartner, Iv...
« Prev « First page 1104 / 1380 Last » Next »