Sciweavers

5372 search results - page 729 / 1075
» complexity 2007
Sort
View
ACSC
2007
IEEE
16 years 1 months ago
Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
Lin Tian, Tadao Takaoka
ACSC
2007
IEEE
16 years 1 months ago
Mutually Visible Agents in a Discrete Environment
As computer controlled entities are set to move and explore more complex environments they need to be able to perform navigation tasks, like finding minimal cost routes. Much wor...
Joel Fenwick, Vladimir Estivill-Castro
AGILEDC
2007
IEEE
16 years 1 months ago
Agile Program Management: Lessons Learned from the VeriSign Managed Security Services Team
This report examines how the VeriSign Managed Security Services team (MSS) has successfully extended agile software development practices to deal with a complex, multi-product dev...
Peter Hodgkins, Luke Hohmann
AGILEDC
2007
IEEE
16 years 1 months ago
Large Build Teams: Help or Hindrance?
Should we use build and deployment teams on large projects? Build and deployment work often emerges as a specialization on project teams. This specialization becomes important on ...
Julian Simpson, Shane Duan
AINA
2007
IEEE
16 years 1 months ago
Collaborative Signal Reinforcement in Sensor Networks
Nodes in sensor fields and in autonomous swarms of mobile robots need to communicate; this usually requires individual nodes to either consume a significant amount of energy, ca...
Tingting Meng, Peter M. Athanas