167 search results - page 23 / 34 » A class of polynomially solvable linear complementarity prob... |
107
click to vote
CSR
2008
Springer
15 years 13 days ago
2008
Springer
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
DNA
2006
Springer
15 years 4 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
109
click to vote
ACID
2006
15 years 1 months ago
2006
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
AIPS
2006
15 years 1 months ago
2006
In this paper we describe the problem of Optimal Competitive Scheduling, which consists of activities that compete for a shared resource. The objective is to choose a subset of ac...
109
click to vote
ACMICEC
2003
ACM
15 years 5 months ago
2003
ACM
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...