Sciweavers

1456 search results - page 63 / 292
» Two Techniques to Improve Finite Model Search
Sort
View
CCGRID
2003
IEEE
14 years 1 months ago
Criticality-based Analysis and Design of Unstructured Peer-to-Peer Networks as "Complex Systems"
— Due to enormous complexity of the unstructured peer-to-peer networks as large-scale, self-configure, and dynamic systems, the models used to characterize these systems are eit...
Farnoush Banaei Kashani, Cyrus Shahabi
IPPS
2005
IEEE
14 years 1 months ago
Fast Address Translation Techniques for Distributed Shared Memory Compilers
The Distributed Shared Memory (DSM) model is designed to leverage the ease of programming of the shared memory paradigm, while enabling the highperformance by expressing locality ...
François Cantonnet, Tarek A. El-Ghazawi, Pa...
MIDDLEWARE
2005
Springer
14 years 1 months ago
An Optimal Overlay Topology for Routing Peer-to-Peer Searches
Unstructured peer-to-peer networks are frequently used as the overlay in various middleware toolkits for emerging applications, from content discovery to query result caching to di...
Brian F. Cooper
CEC
2007
IEEE
13 years 12 months ago
Efficient assembling of genome fragments using genetic algorithm enhanced by heuristic search
Abstract-- Shotgun sequencing is the state-of-the-art to decode genome sequence. However this technique needs a lot of fragments. Combining those fragments correctly requires enorm...
Satoko Kikuchi, Goutam Chakraborty
ATAL
2007
Springer
14 years 2 months ago
On opportunistic techniques for solving decentralized Markov decision processes with temporal constraints
Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve...
Janusz Marecki, Milind Tambe