Sciweavers

6149 search results - page 294 / 1230
» Revealing the programming process
Sort
View
CP
2010
Springer
15 years 4 months ago
Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
David Allouche, Simon de Givry, Thomas Schiex
PAAMS
2010
Springer
15 years 4 months ago
An Automatic Programming ACO-Based Algorithm for Classification Rule Mining
In this paper we present a novel algorithm, named GBAP, that jointly uses automatic programming with ant colony optimization for mining classification rules. GBAP is based on a con...
Juan Luis Olmo, Jose María Luna, José...
IJACTAICIT
2010
95views more  IJACTAICIT 2010»
15 years 4 months ago
Expert System Design of Two Electrostatic Lenses Column by Mixing Dynamic Programming and AI Techniques
This paper have shown an expert system design by using optimization methods for the Focused ion beam FIB optical system, by mixing the dynamic programming procedure and artificial...
Fadhil A. Ali
171
Voted
VLSID
2007
IEEE
160views VLSI» more  VLSID 2007»
16 years 7 months ago
Spectral RTL Test Generation for Microprocessors
We introduce a novel method of test generation for microprocessors at the RTL using spectral methods. Test vectors are generated for RTL faults, which are the stuck-at faults on i...
Nitin Yogi, Vishwani D. Agrawal
ICALP
2009
Springer
16 years 7 months ago
B-Treaps: A Uniquely Represented Alternative to B-Trees
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
Daniel Golovin