Sciweavers

832 search results - page 127 / 167
» Parallel algorithms for solving aggregated shortest-path pro...
Sort
View
107
Voted
FGCS
2010
119views more  FGCS 2010»
14 years 8 months ago
Characterizing fault tolerance in genetic programming
Evolutionary Algorithms, including Genetic Programming (GP), are frequently employed to solve difficult real-life problems, which can require up to days or months of computation. ...
Daniel Lombraña Gonzalez, Francisco Fern&aa...
61
Voted
ICDCS
2008
IEEE
15 years 4 months ago
Multi-Site Retrieval of Declustered Data
Declustering techniques reduce query response times through parallel I/O by distributing data among multiple devices. Recently, replication based approaches were proposed to furth...
Ali Saman Tosun
IPPS
2002
IEEE
15 years 2 months ago
Approximate String Matching in LDAP Based on Edit Distance
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
Chi-Chien Pan, Kai-Hsiang Yang, Tzao-Lin Lee
77
Voted
IPPS
2007
IEEE
15 years 4 months ago
The Adaptive Code Kitchen: Flexible Tools for Dynamic Application Composition
Driven by the increasing componentization of scientific codes, the deployment of high-end system infrastructures such as the Grid, and the desire to support high level problem so...
Pilsung Kang 0002, Mike Heffner, Joy Mukherjee, Na...
CONCUR
2000
Springer
15 years 2 months ago
LP Deadlock Checking Using Partial Order Dependencies
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
Victor Khomenko, Maciej Koutny