1933 search results - page 114 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
148
click to vote
IEEEPACT
2002
IEEE
15 years 8 months ago
2002
IEEE
Memory performance is increasingly determining microprocessor performance and technology trends are exacerbating this problem. Most architectures use set-associative caches with L...
158
click to vote
GECCO
2004
Springer
2004
Springer
Using Clustering Techniques to Improve the Performance of a Multi-objective Particle Swarm Optimizer
15 years 9 months ago
In this paper, we present an extension of the heuristic called “particle swarm optimization” (PSO) that is able to deal with multiobjective optimization problems. Our approach ...
143
Voted
MFCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
143
Voted
CAD
2008
Springer
15 years 3 months ago
2008
Springer
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
147
click to vote
COMGEO
2012
ACM
13 years 11 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...