2796 search results - page 337 / 560 » The coolest path problem |
186
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— We consider the problem of determining the existence of known constant signals over a set of sites, given noisy measurements obtained by a team of active sensors that can switc...
173
click to vote
OPODIS
2007
15 years 8 months ago
2007
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...
155
click to vote
COR
2008
15 years 6 months ago
2008
Discrete-time optimal control problems arise naturally in many economic problems. Despite the rapid growth in computing power and new developments in the literature, many economic...
172
click to vote
ENGL
2007
15 years 6 months ago
2007
Abstract—In any formal theory, a proof is a sequence of well formed formulas (wff). Here, we consider the digraph whose nodes are proofs and the edges are pairs of proofs such t...
173
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
We study the following variant of the well-known line-simplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . in the plane defining a polyg...