Sciweavers

2796 search results - page 68 / 560
» The coolest path problem
Sort
View
SIAMNUM
2011
102views more  SIAMNUM 2011»
14 years 4 months ago
Differential Equations for Roaming Pseudospectra: Paths to Extremal Points and Boundary Tracking
Abstract. When studying the ε-pseudospectrum of a matrix, one is often interested in computing the extremal points having maximum real part or modulus. This is a crucial step, for...
Nicola Guglielmi, Christian Lubich
ICSE
2008
IEEE-ACM
16 years 2 months ago
Answering common questions about code
Difficulties understanding update paths while understanding code cause developers to waste time and insert bugs. A detailed investigation of these difficulties suggests that a wid...
Thomas D. LaToza
ICRA
2002
IEEE
111views Robotics» more  ICRA 2002»
15 years 6 months ago
Mission Planning for the Sun-Synchronous Navigation Field Experiment
This paper describes TEMPEST, a planner that enables a solar-powered rover to reason about path selection and event placement in terms of available solar energy and anticipated po...
Paul Tompkins, Anthony Stentz, William Whittaker
CDC
2008
IEEE
115views Control Systems» more  CDC 2008»
15 years 8 months ago
Continuous path planning for a data harvesting mobile server
— We consider a queueing system composed of queues distributed at fixed locations in a continuous environment and a mobile server serving the jobs in the queues with spatially v...
Jerome Le Ny, Munther A. Dahleh, Eric Feron, Emili...
MFCS
2007
Springer
15 years 8 months ago
Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
Paul S. Bonsma, Luis Cereceda