976 search results - page 7 / 196 » The Complexity of Timetable Construction Problems |
108
click to vote
SIAMCOMP
2000
14 years 11 months ago
2000
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
115
click to vote
CONSTRAINTS
2006
14 years 11 months ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
82
Voted
IJAC
2007
14 years 11 months ago
2007
In this paper we produce a finite algebra which generates a variety with a PSPACE-complete membership problem. We produce another finite algebra with a γ function that grows exp...
DAWAK
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. This paper addresses a task of variable selection which consists in choosing a subset of variables that is sufficient to predict the target label well. Here instead of tr...
114
click to vote
BMCBI
2008
14 years 12 months ago
2008
Background: Ontologies such as the Gene Ontology can enable the construction of complex queries over biological information in a conceptual way, however existing systems to do thi...