Sciweavers

7167 search results - page 869 / 1434
» Answer Set Programming
Sort
View
EOR
2007
113views more  EOR 2007»
15 years 5 months ago
Duality for location problems with unbounded unit balls
Abstract. Given an optimization problem with a composite of a convex and componentwise increasing function with a convex vector function as objective function, by means of the conj...
Gert Wanka, Radu Ioan Bot, Emese Vargyas
SIAMJO
2008
212views more  SIAMJO 2008»
15 years 5 months ago
Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. ...
Radek Kucera
AIR
2005
122views more  AIR 2005»
15 years 5 months ago
The Genetic Kernel Support Vector Machine: Description and Evaluation
The Support Vector Machine (SVM) has emerged in recent years as a popular approach to the classification of data. One problem that faces the user of an SVM is how to choose a kerne...
Tom Howley, Michael G. Madden
HEURISTICS
1998
103views more  HEURISTICS 1998»
15 years 4 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
MICRO
2010
IEEE
238views Hardware» more  MICRO 2010»
15 years 3 months ago
Sampling Dead Block Prediction for Last-Level Caches
Last-level caches (LLCs) are large structures with significant power requirements. They can be quite inefficient. On average, a cache block in a 2MB LRU-managed LLC is dead 86% of ...
Samira Manabi Khan, Yingying Tian, Daniel A. Jimen...