Sciweavers

4491 search results - page 236 / 899
» Algorithm Engineering
Sort
View
101
Voted
SPAA
2003
ACM
15 years 8 months ago
Asynchronous parallel disk sorting
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
Roman Dementiev, Peter Sanders
145
Voted
KBSE
2010
IEEE
15 years 16 days ago
Seamlessly integrated, but loosely coupled: building user interfaces from heterogeneous components
User interface development is a time and resource consuming task. Thus, reusing existing UI components is a desirable approach for rapid UI development. To keep UIs maintainable, ...
Heiko Paulheim
99
Voted
VLSI
2010
Springer
15 years 1 months ago
Fine-grained post placement voltage assignment considering level shifter overhead
—Multi-Vdd techniques enable application of lower supply voltage levels on cells with timing slacks. New voltage assignment, placement and voltage island partitioning methods are...
Zohreh Karimi, Majid Sarrafzadeh
164
Voted
AOSD
2011
ACM
14 years 6 months ago
An aspect-oriented approach for implementing evolutionary computation applications
Object-oriented frameworks support design and code reuse for specific application domains. To facilitate the development of evolutionary computation (EC) programs, such as geneti...
Andres J. Ramirez, Adam C. Jensen, Betty H. C. Che...
131
Voted
TSE
2010
110views more  TSE 2010»
15 years 1 months ago
Proofs from Tests
We present an algorithm Dash to check if a program P satisfies a safety property ϕ. The unique feature of the algorithm is that it uses only test generation operations, and nes ...
Nels E. Beckman, Aditya V. Nori, Sriram K. Rajaman...