3946 search results - page 195 / 790 » The computational complexity of choice sets |
190
click to vote
DM
2006
15 years 6 months ago
2006
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
157
click to vote
WABI
2007
Springer
16 years 22 days ago
2007
Springer
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
176
click to vote
WSC
1997
15 years 8 months ago
1997
This article discusses implementation issues for the LBATCH and ABATCH batch means procedures of Fishman and Yarberry (1997). Theses procedures dynamically increase the batch size...
182
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
By a Euclidean logic, we understand a formal language whose variables range over subsets of Euclidean space, of some fixed dimension, and whose non-logical primitives have fixed me...
169
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (r...