Sciweavers

603 search results - page 49 / 121
» DFS-Tree Based Heuristic Search
Sort
View
LCTRTS
2010
Springer
13 years 5 months ago
Improving both the performance benefits and speed of optimization phase sequence searches
The issues of compiler optimization phase ordering and selection present important challenges to compiler developers in several domains, and in particular to the speed, code size,...
Prasad A. Kulkarni, Michael R. Jantz, David B. Wha...
ISLPED
2010
ACM
181views Hardware» more  ISLPED 2010»
13 years 6 months ago
Exploiting power budgeting in thermal-aware dynamic placement for reconfigurable systems
 In this paper, a novel thermal-aware dynamic placement planner for reconfigurable systems is presented, which targets transient temperature reduction. Rather than solving time-...
Shahin Golshan, Eli Bozorgzadeh, Benjamin Carri&oa...
GIS
2009
ACM
14 years 9 months ago
An Interactive Approach to Route Search
A route leads from a start location to a final destination and passes through geospatial entities that are picked according to search terms provided by the user. Each entity is pe...
Yaron Kanza, Roy Levin, Eliyahu Safra, Yehoshua Sa...
DOLAP
2003
ACM
14 years 1 months ago
Spatial hierarchy and OLAP-favored search in spatial data warehouse
Data warehouse and Online Analytical Processing(OLAP) play a key role in business intelligent systems. With the increasing amount of spatial data stored in business database, how ...
Fangyan Rao, Long Zhang, Xiulan Yu, Ying Li, Ying ...
BMCBI
2011
12 years 11 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes