Sciweavers

261 search results - page 42 / 53
» Unavoidable sequences in constructive analysis
Sort
View
TOG
2002
116views more  TOG 2002»
15 years 5 months ago
Linear combination of transformations
Geometric transformations are most commonly represented as square matrices in computer graphics. Following simple geometric arguments we derive a natural and geometrically meaning...
Marc Alexa
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
16 years 15 days ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke
CGO
2008
IEEE
16 years 12 days ago
Prediction and trace compression of data access addresses through nested loop recognition
This paper describes an algorithm that takes a trace (i.e., a sequence of numbers or vectors of numbers) as input, and from that produces a sequence of loop nests that, when run, ...
Alain Ketterlin, Philippe Clauss
EACL
1993
ACL Anthology
15 years 7 months ago
A Computational Treatment of Sentence-Final 'then'
We describe a computational system which parses discourses consisting of sequences of simple sentences. These contain a range of temporal constructions, including time adverbials,...
Sheila Glasbey
BMCBI
2010
104views more  BMCBI 2010»
15 years 6 months ago
A novel scoring function for discriminating hyperthermophilic and mesophilic proteins with application to predicting relative th
Background: The ability to design thermostable proteins is theoretically important and practically useful. Robust and accurate algorithms, however, remain elusive. One critical pr...
Yunqi Li, C. Russell Middaugh, Jianwen Fang