Sciweavers

708 search results - page 94 / 142
» Timing closure: the solution and its problems
Sort
View
CG
2010
Springer
14 years 8 months ago
Scalability and Parallelization of Monte-Carlo Tree Search
Monte-Carlo Tree Search is now a well established algorithm, in games and beyond. We analyze its scalability, and in particular its limitations, and the implications in terms of pa...
Amine Bourki, Guillaume Chaslot, Matthieu Coulm, V...
KDD
2012
ACM
194views Data Mining» more  KDD 2012»
13 years 13 days ago
A sparsity-inducing formulation for evolutionary co-clustering
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
Shuiwang Ji, Wenlu Zhang, Jun Liu
PLDI
2006
ACM
15 years 4 months ago
A global progressive register allocator
This paper describes a global progressive register allocator, a register allocator that uses an expressive model of the register allocation problem to quickly find a good allocat...
David Ryan Koes, Seth Copen Goldstein
APWEB
2004
Springer
15 years 3 months ago
Using Relational Database Constraints to Design Materialized Views in Data Warehouses
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...
Taehee Lee, Jae-young Chang, Sang-goo Lee
COMAD
2008
14 years 11 months ago
An Incremental Summary Generation System
Huge amount of information is present in the World Wide Web and a large amount is being added to it frequently. A query-specific summary of multiple documents is very helpful to t...
C. Ravindranath Chowdary, P. Sreenivasa Kumar