Sciweavers

4809 search results - page 743 / 962
» CajunBot: Architecture and algorithms
Sort
View
TAAS
2008
70views more  TAAS 2008»
15 years 6 months ago
A general characterization of indulgence
characterization of indulgence in an abstract computing model that encompasses various communication and resilience schemes. We use our characterization to establish several result...
Rachid Guerraoui, Nancy A. Lynch
JAIR
2007
114views more  JAIR 2007»
15 years 6 months ago
Marvin: A Heuristic Search Planner with Online Macro-Action Learning
This paper describes Marvin, a planner that competed in the Fourth International Planning Competition (IPC 4). Marvin uses action-sequence-memoisation techniques to generate macro...
Andrew Coles, Kate A. Smith
CF
2007
ACM
15 years 10 months ago
Parallel genomic sequence-search on a massively parallel system
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
Oystein Thorsen, Brian E. Smith, Carlos P. Sosa, K...
EUMAS
2006
15 years 8 months ago
A Customizable Multi-Agent System for Distributed Data Mining
We present a general Multi-Agent System framework for distributed data mining based on a Peer-toPeer model. The framework adopts message-based asynchronous communication and a dyn...
Giancarlo Fortino, Giuseppe Di Fatta
FPGA
1998
ACM
132views FPGA» more  FPGA 1998»
15 years 10 months ago
Circuit Partitioning with Complex Resource Constraints in FPGAs
In this paper, we present an algorithm for circuit partitioning with complex resource constraints in large FPGAs. Traditional partitioning methods estimate the capacity of an FPGA...
Huiqun Liu, Kai Zhu, D. F. Wong