692 search results - page 47 / 139 » Some research questions for computational transportation sci... |
COMPGEOM
1995
ACM
15 years 1 months ago
1995
ACM
Abstract. We show that there is a matching between the edges of any two triangulations of a planar point set such that an edge of one triangulation is matched either to the identic...
104
click to vote
EC
1998
14 years 9 months ago
1998
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
CSR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Ordering constraints are analogous to instances of the satisfiability problem in conjunctive normalform, but instead of a boolean assignment we consider a linear orderin...
RTA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Co...
122
click to vote
GIS
2002
ACM
14 years 9 months ago
2002
ACM
Emerging computational paradigms such as global and ubiquitous computing require some rethinking and innovative research ideas in many computer science areas. In this work, we aim...