Sciweavers

693 search results - page 115 / 139
» Complexity Analysis of Heuristic CSP Search Algorithms
Sort
View
CGO
2008
IEEE
14 years 2 months ago
Cole: compiler optimization level exploration
Modern compilers implement a large number of optimizations which all interact in complex ways, and which all have a different impact on code quality, compilation time, code size,...
Kenneth Hoste, Lieven Eeckhout
VRST
2009
ACM
14 years 2 months ago
Indexing and retrieval of human motion data by a hierarchical tree
For the convenient reuse of large-scale 3D motion capture data, browsing and searching methods for the data should be explored. In this paper, an efficient indexing and retrieval...
Shuangyuan Wu, Zhaoqi Wang, Shihong Xia
GECCO
2006
Springer
140views Optimization» more  GECCO 2006»
13 years 11 months ago
A representational ecology for learning classifier systems
The representation used by a learning algorithm introduces a bias which is more or less well-suited to any given learning problem. It is well known that, across all possible probl...
James A. R. Marshall, Tim Kovacs
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
14 years 2 months ago
Extended probe method for linkage discovery over high-cardinality alphabets
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
Shude Zhou, Zengqi Sun, Robert B. Heckendorn
ACL
2011
12 years 11 months ago
A Comparison of Loopy Belief Propagation and Dual Decomposition for Integrated CCG Supertagging and Parsing
Via an oracle experiment, we show that the upper bound on accuracy of a CCG parser is significantly lowered when its search space is pruned using a supertagger, though the supert...
Michael Auli, Adam Lopez