Sciweavers

1529 search results - page 22 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
IJCAI
1989
15 years 26 days ago
Goal Ordering in Partially Ordered Plans
Partially ordered plans have not solved the goal ordering problem. Consider: a goal in a par­ tially ordered plan is an operator precondition that is not yet achieved; operators,...
Mark Drummond, Ken Currie
93
Voted
GECCO
2000
Springer
109views Optimization» more  GECCO 2000»
15 years 3 months ago
Crossover in Probability Spaces
This paper proposes a new crossover operator for searching over discrete probability spaces. The design of the operator is considered in the light of recent theoretical insights i...
Siddhartha Bhattacharyya, Marvin D. Troutt
IEEEPACT
1998
IEEE
15 years 4 months ago
A Matrix-Based Approach to the Global Locality Optimization Problem
Global locality analysis is a technique for improving the cache performance of a sequence of loop nests through a combination of loop and data layout optimizations. Pure loop tran...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
ICPR
2004
IEEE
16 years 24 days ago
Classification Probability Analysis of Principal Component Null Space Analysis
In a previous paper [1], we have presented a new linear classification algorithm, Principal Component Null Space Analysis (PCNSA) which is designed for problems like object recogn...
Namrata Vaswani, Rama Chellappa
JC
2006
97views more  JC 2006»
14 years 11 months ago
Optimal approximation of elliptic problems by linear and nonlinear mappings II
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
Stephan Dahlke, Erich Novak, Winfried Sickel