692 search results - page 63 / 139 » Some research questions for computational transportation sci... |
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
As computational devices continue to advance, there are reasons to examine their foundations a little more deeply, and to ask whether there may not be something more to be found. ...
AB
2007
Springer
15 years 4 months ago
2007
Springer
What is systems biology? What can biologists gain from an attempt to algebraize the questions in systems biology? Starting with plausible biological theses, can one algebraically m...
ICTCS
2005
Springer
15 years 3 months ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. A simple nonconstructive argument shows that most 3CNF formulas with cn clauses (where c is a large enough constant) are not satisfiable. It is an open question whether ...