Sciweavers

3663 search results - page 84 / 733
» Problems in the ontology of computer programs
Sort
View
PPOPP
1995
ACM
15 years 1 months ago
A Model and Compilation Strategy for Out-of-Core Data Parallel Programs
It is widely acknowledged in high-performance computing circles that parallel input/output needs substantial improvement in order to make scalable computers truly usable. We prese...
Rajesh Bordawekar, Alok N. Choudhary, Ken Kennedy,...
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
15 years 4 months ago
Eye-tracking evolutionary algorithm to minimize user fatigue in IEC applied to interactive one-max problem
In this paper, we describe a new algorithm that consists in combining an eye-tracker for minimizing the fatigue of a user during the evaluation process of Interactive Evolutionary...
Denis Pallez, Philippe Collard, Thierry Baccino, L...
FCT
2003
Springer
15 years 3 months ago
Proving Integrality Gaps without Knowing the Linear Program
: Proving integrality gaps for linear relaxations of NP optimization problems is a difficult task and usually undertaken on a case-by-case basis. We initiate a more systematic app...
Sanjeev Arora
DIS
2010
Springer
14 years 7 months ago
Sparse Substring Pattern Set Discovery Using Linear Programming Boosting
In this paper, we consider finding a small set of substring patterns which classifies the given documents well. We formulate the problem as 1 norm soft margin optimization problem ...
Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Mas...
EUROGP
1998
Springer
15 years 2 months ago
Immediate Transfer of Global Improvements to All Individuals in a Population Compared to Automatically Defined Functions for the
Koza has shown how automatically defined functions (ADFs) can reduce computational effort in the GP paradigm. In Koza's ADF, as well as in standard GP, an improvement in a par...
Ricardo Aler