1933 search results - page 81 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
121
click to vote
ISCAS
2006
IEEE
15 years 9 months ago
2006
IEEE
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...
156
Voted
PRICAI
1998
Springer
15 years 7 months ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
138
Voted
JCO
2007
15 years 3 months ago
2007
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
137
Voted
EMO
2006
Springer
15 years 7 months ago
2006
Springer
Multi-Objective Evolutionary Algorithms (MOEA) have been succesfully applied to solve control problems. However, many improvements are still to be accomplished. In this paper a new...
146
Voted
STOC
2004
ACM
16 years 3 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...