Sciweavers

4843 search results - page 4 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
21
Voted
COCO
2010
Springer
180views Algorithms» more  COCO 2010»
13 years 11 months ago
Completely Inapproximable Monotone and Antimonotone Parameterized Problems
We prove that weighted monotone/antimonotone circuit satisfiability has no fixed-parameter tractable approximation algorithm with any approximation ratio function ρ, unless FPT...
Dániel Marx
ICML
2009
IEEE
14 years 2 months ago
Fast evolutionary maximum margin clustering
The maximum margin clustering approach is a recently proposed extension of the concept of support vector machines to the clustering problem. Briefly stated, it aims at finding a...
Fabian Gieseke, Tapio Pahikkala, Oliver Kramer
ICCAD
2000
IEEE
88views Hardware» more  ICCAD 2000»
13 years 12 months ago
DRAGON2000: Standard-Cell Placement Tool for Large Industry Circuits
In this paper, we develop a new standard cell placement tool, Dragon2000, to solve large scale placement problem effectively. A top-down hierarchical approach is used in Dragon200...
Maogang Wang, Xiaojian Yang, Majid Sarrafzadeh
MOC
2000
83views more  MOC 2000»
13 years 7 months ago
On the problem of spurious eigenvalues in the approximation of linear elliptic problems in mixed form
In the approximation of linear elliptic operators in mixed form, it is well known that the so-called inf-sup and ellipticity in the kernel properties are sufficient (and, in a sens...
Daniele Boffi, Franco Brezzi, Lucia Gastaldi