Sciweavers

4131 search results - page 31 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
AMAI
1999
Springer
15 years 1 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen
TEC
2010
77views more  TEC 2010»
14 years 8 months ago
On Set-Based Multiobjective Optimization
Abstract--Assuming that evolutionary multiobjective optimization (EMO) mainly deals with set problems, one can identify three core questions in this area of research: (i) how to fo...
Eckart Zitzler, Lothar Thiele, Johannes Bader
AIEDAM
1998
87views more  AIEDAM 1998»
15 years 1 months ago
Learning to set up numerical optimizations of engineering designs
Gradient-based numerical optimization of complex engineering designs offers the promise of rapidly producing better designs. However, such methods generally assume that the object...
Mark Schwabacher, Thomas Ellman, Haym Hirsh
HIPC
2009
Springer
14 years 11 months ago
Optimizing the use of GPU memory in applications with large data sets
Abstract--With General Purpose programmable GPUs becoming more and more popular, automated tools are needed to bridge the gap between achievable performance from highly parallel ar...
Nadathur Satish, Narayanan Sundaram, Kurt Keutzer
EOR
2010
82views more  EOR 2010»
15 years 2 months ago
Satisfactory graph partition, variants, and generalizations
The Satisfactory Partition problem asks for deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighbor...
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten