Sciweavers

12950 search results - page 22 / 2590
» On Optimal Timed Strategies
Sort
View
TNN
1998
76views more  TNN 1998»
13 years 7 months ago
Multiobjective genetic algorithm partitioning for hierarchical learning of high-dimensional pattern spaces: a learning-follows-d
— In this paper, we present a novel approach to partitioning pattern spaces using a multiobjective genetic algorithm for identifying (near-)optimal subspaces for hierarchical lea...
Rajeev Kumar, Peter Rockett
IRREGULAR
1995
Springer
13 years 11 months ago
Run-Time Techniques for Parallelizing Sparse Matrix Problems
Sparse matrix problems are di cult to parallelize e ciently on message-passing machines, since they access data through multiple levels of indirection. Inspector executor strategie...
Manuel Ujaldon, Shamik D. Sharma, Joel H. Saltz, E...
SIGMOD
2011
ACM
267views Database» more  SIGMOD 2011»
12 years 10 months ago
A latency and fault-tolerance optimizer for online parallel query plans
We address the problem of making online, parallel query plans fault-tolerant: i.e., provide intra-query fault-tolerance without blocking. We develop an approach that not only achi...
Prasang Upadhyaya, YongChul Kwon, Magdalena Balazi...
AIR
2005
98views more  AIR 2005»
13 years 7 months ago
Evolving Dynamic Multi-Objective Optimization Problems with Objective Replacement
This paper studies the strategies for multi-objective optimization in a dynamic environment. In particular, we focus on problems with objective replacement, where some objectives ...
Sheng Uei Guan, Qian Chen, Wenting Mo
ICC
2007
IEEE
157views Communications» more  ICC 2007»
13 years 9 months ago
On the Effectiveness of the 2-hop Routing Strategy in Mobile Ad Hoc Networks
— In this paper, we study the performance of the 2-hop routing scheme proposed for ad hoc wireless networks with mobile nodes, considering realistic node mobility patterns. First...
Michele Garetto, Paolo Giaccone, Emilio Leonardi