1185 search results - page 63 / 237 » The Equivalence of Sampling and Searching |
100
Voted
JCO
2007
15 years 12 days ago
2007
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...
GD
2006
Springer
15 years 4 months ago
2006
Springer
We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continu...
107
Voted
WSC
1998
15 years 1 months ago
1998
We consider a new simulation-based optimization method called the Nested Partitions (NP) method. This method generates a Markov chain and solving the optimization problem is equiv...
84
Voted
ISMB
1994
15 years 1 months ago
1994
Weuse a quantitative definition of specificity to developa neural networkfor the identification of commonprotein binding sites in a collection of unaligned DNAfragments. Wedemonst...
103
Voted
MCSS
2002
Springer
15 years 5 days ago
2002
Springer
In this paper, we study the observability properties of nonlinear discrete time systems. Two types of contributions are given. First, we present observability criteria in terms of...