Sciweavers

2700 search results - page 347 / 540
» Processor Architectures for Ontogenesis
Sort
View
AAAI
1997
15 years 6 months ago
Efficient Management of Very Large Ontologies
This paper describes an environment for supporting very large ontologies. The system can be used on single PCs, workstations, a cluster of workstations, and high-end parallel supe...
Kilian Stoffel, Merwyn G. Taylor, James A. Hendler
134
Voted
JSAT
2008
85views more  JSAT 2008»
15 years 4 months ago
Parallel SAT Solving using Bit-level Operations
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
Marijn Heule, Hans van Maaren
EOR
2007
87views more  EOR 2007»
15 years 4 months ago
An optimal and scalable parallelization of the two-list
In this paper, we suggest a parallel algorithm based on a shared memory SIMD architecture for solving an n item subset-sum problem in time O(2n/2 /p) by using p = 2q processors, 0...
Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma,...
248
Voted
ICS
2007
Tsinghua U.
15 years 10 months ago
Scheduling FFT computation on SMP and multicore systems
Increased complexity of memory systems to ameliorate the gap between the speed of processors and memory has made it increasingly harder for compilers to optimize an arbitrary code...
Ayaz Ali, S. Lennart Johnsson, Jaspal Subhlok
CP
2008
Springer
15 years 6 months ago
An Application of Constraint Programming to Superblock Instruction Scheduling
Modern computer architectures have complex features that can only be fully taken advantage of if the compiler schedules the compiled code. A standard region of code for scheduling ...
Abid M. Malik, Michael Chase, Tyrel Russell, Peter...