Sciweavers

1018 search results - page 155 / 204
» A Comparative Evaluation of Length Estimators
Sort
View
DCC
2008
IEEE
15 years 9 months ago
Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries
The Range Minimum Query (RMQ) Problem is to preprocess an array A of length n in O(n) time such that subsequent on-line queries asking for the position of a minimal element between...
Johannes Fischer, Volker Heun, Horst Martin St&uum...
GECCO
2007
Springer
211views Optimization» more  GECCO 2007»
15 years 4 months ago
An extremal optimization search method for the protein folding problem: the go-model example
The protein folding problem consists of predicting the functional (native) structure of the protein given its linear sequence of amino acids. Despite extensive progress made in un...
Alena Shmygelska
ICNP
2006
IEEE
15 years 4 months ago
RAIN: A Reliable Wireless Network Architecture
Abstract— Despite years of research and development, pioneering deployments of multihop wireless networks have not proven successful. The performance of routing and transport is ...
Chaegwon Lim, Haiyun Luo, Chong-Ho Choi
CCGRID
2005
IEEE
15 years 3 months ago
Mapping DAG-based applications to multiclusters with background workload
Before an application modelled as a Directed Acyclic Graph (DAG) is executed on a heterogeneous system, a DAG mapping policy is often enacted. After mapping, the tasks (in the DAG...
Ligang He, Stephen A. Jarvis, Daniel P. Spooner, D...
MICRO
2005
IEEE
126views Hardware» more  MICRO 2005»
15 years 3 months ago
Cost Sensitive Modulo Scheduling in a Loop Accelerator Synthesis System
Scheduling algorithms used in compilers traditionally focus on goals such as reducing schedule length and register pressure or producing compact code. In the context of a hardware...
Kevin Fan, Manjunath Kudlur, Hyunchul Park, Scott ...