Sciweavers

2252 search results - page 441 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
SIGMOD
2009
ACM
161views Database» more  SIGMOD 2009»
14 years 2 months ago
Dependency-aware reordering for parallelizing query optimization in multi-core CPUs
The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming (DP) to find the optimal query execution plan (QEP) without evalua...
Wook-Shin Han, Jinsoo Lee
ROBOCUP
1999
Springer
115views Robotics» more  ROBOCUP 1999»
13 years 11 months ago
UBU Team
The underlying research topics and the architecture of the UBU team are briefly described. The aim of developing UBU is to subject a series of tools and procedures for agent decis...
Johan Kummeneje, David Lybäck, Håkan L....
CORR
2006
Springer
109views Education» more  CORR 2006»
13 years 7 months ago
On Conditional Branches in Optimal Decision Trees
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
Michael B. Baer
HPCA
2011
IEEE
12 years 11 months ago
Archipelago: A polymorphic cache design for enabling robust near-threshold operation
Extreme technology integration in the sub-micron regime comes with a rapid rise in heat dissipation and power density for modern processors. Dynamic voltage scaling is a widely us...
Amin Ansari, Shuguang Feng, Shantanu Gupta, Scott ...
GIS
2007
ACM
14 years 8 months ago
Quality-driven geospatial data integration
Accurate and efficient integration of geospatial data is an important problem with applications in areas such as emergency response and urban planning. Some of the key challenges ...
Craig A. Knoblock, José Luis Ambite, Snehal...