Sciweavers

241 search results - page 31 / 49
» Fast heuristics for large scale covering-location problems
Sort
View
IJAIT
2008
99views more  IJAIT 2008»
14 years 9 months ago
Optimal Basic Block Instruction Scheduling for Multiple-Issue Processors Using Constraint Programming
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction sch...
Abid M. Malik, Jim McInnes, Peter van Beek
FPGA
1999
ACM
142views FPGA» more  FPGA 1999»
15 years 1 months ago
Multi-Terminal Net Routing for Partial Crossbar-Based Multi-FPGA Systems
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
Abdel Ejnioui, N. Ranganathan
DCOSS
2011
Springer
13 years 9 months ago
Planning the trajectories of multiple mobile sinks in large-scale, time-sensitive WSNs
—Controlled sink mobility has been shown to be very beneficial in lifetime prolongation of wireless sensor networks (WSNs) by avoiding the typical hot-spot problem near the sink...
Wint Yi Poe, Michael Beck, Jens B. Schmitt
CASES
2003
ACM
15 years 1 months ago
A hierarchical approach for energy efficient application design using heterogeneous embedded systems
Several features such as reconfiguration, voltage and frequency scaling, low-power operating states, duty-cycling, etc. are exploited for latency and energy efficient application ...
Sumit Mohanty, Viktor K. Prasanna
FAST
2011
14 years 1 months ago
Emulating Goliath Storage Systems with David
Benchmarking file and storage systems on large filesystem images is important, but difficult and often infeasible. Typically, running benchmarks on such large disk setups is a ...
Nitin Agrawal, Leo Arulraj, Andrea C. Arpaci-Dusse...