Sciweavers

976 search results - page 7 / 196
» The Complexity of Timetable Construction Problems
Sort
View
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
13 years 6 months ago
A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction
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 ...
David Peleg, Vitaly Rubinovich
CONSTRAINTS
2006
115views more  CONSTRAINTS 2006»
13 years 6 months ago
A Cost-Regular Based Hybrid Column Generation Approach
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
IJAC
2007
73views more  IJAC 2007»
13 years 6 months ago
Computationally and Algebraically Complex Finite Algebra Membership Problems
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...
Marcin Kozik
DAWAK
2010
Springer
13 years 6 months ago
Modelling Complex Data by Learning Which Variable to Construct
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...
Françoise Fessant, Aurélie Le Cam, M...
BMCBI
2008
121views more  BMCBI 2008»
13 years 6 months ago
OntoDas - a tool for facilitating the construction of complex queries to the Gene Ontology
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...
Kieran O'Neill, Alexander García Castro, An...