Sciweavers

2192 search results - page 77 / 439
» Algorithms for Challenging Motif Problems
Sort
View
ICDM
2008
IEEE
106views Data Mining» more  ICDM 2008»
14 years 2 months ago
Metropolis Algorithms for Representative Subgraph Sampling
While data mining in chemoinformatics studied graph data with dozens of nodes, systems biology and the Internet are now generating graph data with thousands and millions of nodes....
Christian Hübler, Hans-Peter Kriegel, Karsten...
EVOW
2007
Springer
14 years 2 months ago
An Adaptive Global-Local Memetic Algorithm to Discover Resources in P2P Networks
This paper proposes a neural network based approach for solving the resource discovery problem in Peer to Peer (P2P) networks and an Adaptive Global Local Memetic Algorithm (AGLMA)...
Ferrante Neri, Niko Kotilainen, Mikko Vapa
TIP
2008
175views more  TIP 2008»
13 years 8 months ago
Algorithmic and Architectural Optimizations for Computationally Efficient Particle Filtering
Abstract--In this paper, we analyze the computational challenges in implementing particle filtering, especially to video sequences. Particle filtering is a technique used for filte...
Aswin C. Sankaranarayanan, Ankur Srivastava, Rama ...
BIRTHDAY
2007
Springer
14 years 4 days ago
Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms
Abstract. The Operational Transformation (OT) approach is a technique for supporting optimistic replication in collaborative and mobile systems. It allows the users to concurrently...
Abdessamad Imine, Michaël Rusinowitch
GECCO
2006
Springer
186views Optimization» more  GECCO 2006»
13 years 11 months ago
Genetic algorithms for action set selection across domains: a demonstration
Action set selection in Markov Decision Processes (MDPs) is an area of research that has received little attention. On the other hand, the set of actions available to an MDP agent...
Greg Lee, Vadim Bulitko