4860 search results - page 478 / 972 » SNPs Problems, Complexity, and Algorithms |
140
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We present an algorithm running in time O(n log n) which decides if a wreathclosed permutation class Av(B) given by its finite basis B contains a finite number of simple permutati...
161
click to vote
CONSTRAINTS
2008
15 years 4 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
149
click to vote
FGCS
2008
15 years 4 months ago
2008
The advent of Grid environments made feasible the solution of computational intensive problems in a reliable and cost-effective way. As workflow systems carry out more complex and...
139
click to vote
NCA
2006
IEEE
15 years 4 months ago
2006
IEEE
The goal of this paper is to design a new control algorithm for open-loop control of complex systems. This control approach is based on a genealogical decision tree for both regula...
150
click to vote
SIGECOM
2008
ACM
15 years 4 months ago
2008
ACM
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...