Sciweavers

7225 search results - page 1192 / 1445
» On the Computational Power of Biochemistry
Sort
View
CP
2008
Springer
15 years 3 months ago
Exploiting Decomposition in Constraint Optimization Problems
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
Matthew Kitching, Fahiem Bacchus
ECAI
2008
Springer
15 years 3 months ago
Structure Learning of Markov Logic Networks through Iterated Local Search
Many real-world applications of AI require both probability and first-order logic to deal with uncertainty and structural complexity. Logical AI has focused mainly on handling com...
Marenglen Biba, Stefano Ferilli, Floriana Esposito
ACRI
2010
Springer
15 years 3 months ago
Network Decontamination with Temporal Immunity by Cellular Automata
Abstract. Network decontamination (or disinfection) is a widely studied problem in distributed computing. Network sites are assumed to be contaminated (e.g., by a virus) and a team...
Yassine Daadaa, Paola Flocchini, Nejib Zaguia
FPGA
2008
ACM
163views FPGA» more  FPGA 2008»
15 years 3 months ago
TORCH: a design tool for routing channel segmentation in FPGAs
A design tool for routing channel segmentation in islandstyle FPGAs is presented. Given the FPGA architecture parameters and a set of benchmark designs, the tool optimizes routing...
Mingjie Lin, Abbas El Gamal
ISLPED
2007
ACM
96views Hardware» more  ISLPED 2007»
15 years 3 months ago
Low-power process-variation tolerant arithmetic units using input-based elastic clocking
In this paper we propose a design methodology for low-power, high-performance, process-variation tolerant architecture for arithmetic units. The novelty of our approach lies in th...
Debabrata Mohapatra, Georgios Karakonstantis, Kaus...
« Prev « First page 1192 / 1445 Last » Next »