Sciweavers

741 search results - page 45 / 149
» Problem Programmers
Sort
View
GPCE
2009
Springer
14 years 6 days ago
Extending AspectJ for separating regions
Synchronization is a good candidate for an aspect in aspectoriented programming (AOP) since programmers have to choose the best granularity of synchronization for the underlying h...
Shumpei Akai, Shigeru Chiba
DAC
2006
ACM
14 years 8 months ago
Efficient SAT-based Boolean matching for FPGA technology mapping
Most FPGA technology mapping approaches either target Lookup Tables (LUTs) or relatively simple Programmable Logic Blocks (PLBs). Considering networks of PLBs during technology map...
Sean Safarpour, Andreas G. Veneris, Gregg Baeckler...
GECCO
2004
Springer
129views Optimization» more  GECCO 2004»
14 years 1 months ago
Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
Bryant A. Julstrom
HIPEAC
2007
Springer
14 years 1 months ago
A Throughput-Driven Task Creation and Mapping for Network Processors
Abstract. Network processors are programmable devices that can process packets at a high speed. A network processor is typified by multithreading and heterogeneous multiprocessing...
Lixia Liu, Xiao-Feng Li, Michael K. Chen, Roy Dz-C...
IPPS
2003
IEEE
14 years 27 days ago
A Framework for Portable Shared Memory Programming
Widespread adaptation of shared memory programming for High Performance Computing has been inhibited by a lack of standardization and the resulting portability problems between pl...
Martin Schulz, Sally A. McKee