388 search results - page 57 / 78 » Discrete Hamilton-Jacobi theory and discrete optimal control |
COMBINATORICA
2007
13 years 8 months ago
2007
The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...
KDD
2010
ACM
13 years 7 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Schulenburg [15] first proposed the idea to model different trader types by supplying different input information sets to a group of homogenous LCS agent. Gershoff [12] investigat...
STOC
1996
ACM
14 years 23 days ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
IPSN
2004
Springer
14 years 2 months ago
2004
Springer
Due to constraints in cost, power, and communication, losses often arise in large sensor networks. The sensor can be modeled as an output of a linear stochastic system with random...