Sciweavers

260 search results - page 19 / 52
» Degree constrained subgraphs
Sort
View
ICRA
2009
IEEE
125views Robotics» more  ICRA 2009»
14 years 2 months ago
A novel method for learning policies from constrained motion
— Many everyday human skills can be framed in terms of performing some task subject to constraints imposed by the environment. Constraints are usually unobservable and frequently...
Matthew Howard, Stefan Klanke, Michael Gienger, Ch...
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
14 years 28 days ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
13 years 9 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
SIAMJO
2002
133views more  SIAMJO 2002»
13 years 7 months ago
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
Philip E. Gill, Walter Murray, Michael A. Saunders
DM
2010
107views more  DM 2010»
13 years 7 months ago
Degree-associated reconstruction number of graphs
A card of a graph G is a subgraph formed by deleting one vertex. The Reconstruction Conjecture states that each graph with at least three vertices is determined by its multiset of...
Michael D. Barrus, Douglas B. West