Sciweavers

2192 search results - page 210 / 439
» Algorithms for Challenging Motif Problems
Sort
View
MOBIHOC
2000
ACM
15 years 8 months ago
Utility-based decision-making in wireless sensor networks
— We consider challenges associated with application domains in which a large number of distributed, networked sensors must perform a sensing task repeatedly over time. We addres...
John W. Byers, Gabriel Nasser
HPDC
1996
IEEE
15 years 8 months ago
A Federated Model for Scheduling in Wide-Area Systems
In this paper a model for scheduling in wide-area systems is described. The model is federated and utilizes a collection of local site schedulers that control the use of their res...
Jon B. Weissman, Andrew S. Grimshaw
VL
1996
IEEE
157views Visual Languages» more  VL 1996»
15 years 8 months ago
Visualizing Program Executions on Large Data Sets
Understanding and interpreting a large data source is an important but challenging operation in many technical disciplines. Computer visualization has become a valuable tool to he...
John T. Stasko, Jeyakumar Muthukumarasamy
CEC
2009
IEEE
15 years 8 months ago
Search methodologies for efficient planetary site selection
Landing on distant planets is always a challenging task due to the distance and hostile environments found. In the design of autonomous hazard avoidance systems we find the particu...
Luís F. Simões, Tiago C. Pais, Rita ...
GECCO
2007
Springer
195views Optimization» more  GECCO 2007»
15 years 8 months ago
Diverse committees vote for dependable profits
Stock selection for hedge fund portfolios is a challenging problem for Genetic Programming (GP) because the markets (the environment in which the GP solution must survive) are dyn...
Wei Yan, Christopher D. Clack