Sciweavers

464 search results - page 35 / 93
» Improved Fixed-Parameter Algorithms for Two Feedback Set Pro...
Sort
View
DAC
2005
ACM
13 years 9 months ago
Faster and better global placement by a new transportation algorithm
We present BonnPlace, a new VLSI placement algorithm that combines the advantages of analytical and partitioning-based placers. Based on (non-disjoint) placements minimizing the t...
Ulrich Brenner, Markus Struzyna
COR
2006
95views more  COR 2006»
13 years 7 months ago
Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems
In this paper we tackle the task assignment problem (TSAP) in heterogeneous computer systems. The TSAP consists of assigning a given distributed computer program formed by a numbe...
Sancho Salcedo-Sanz, Yong Xu, Xin Yao
AI
2011
Springer
12 years 11 months ago
Finding Small Backdoors in SAT Instances
Although propositional satisfiability (SAT) is NP-complete, state-of-the-art SAT solvers are able to solve large, practical instances. The concept of backdoors has been introduced...
Zijie Li, Peter van Beek
CVPR
2012
IEEE
11 years 9 months ago
Real-time scene text localization and recognition
An end-to-end real-time scene text localization and recognition method is presented. The real-time performance is achieved by posing the character detection problem as an efficie...
Lukas Neumann, Jiri Matas
CPAIOR
2011
Springer
12 years 11 months ago
Upgrading Shortest Paths in Networks
We introduce the Upgrading Shortest Paths Problem, a new combinatorial problem for improving network connectivity with a wide range of applications from multicast communication to ...
Bistra N. Dilkina, Katherine J. Lai, Carla P. Gome...