Sciweavers

434 search results - page 76 / 87
» Improved Algorithms for the 2-Vertex Disjoint Paths Problem
Sort
View
128
Voted
ATAL
2006
Springer
15 years 7 months ago
Continuous refinement of agent resource estimates
The challenge we address is to reason about projected resource usage within a hierarchical task execution framework in order to improve agent effectiveness. Specifically, we seek ...
David N. Morley, Karen L. Myers, Neil Yorke-Smith
100
Voted
TROB
2002
117views more  TROB 2002»
15 years 3 months ago
Concurrent metamorphosis of hexagonal robot chains into simple connected configurations
Abstract-- The problem addressed is the distributed reconfiguration of a metamorphic robotic system composed of an arbitrary number of two dimensional hexagonal robots (modules) fr...
Jennifer E. Walter, Jennifer L. Welch, Nancy M. Am...
138
Voted
FOCS
1997
IEEE
15 years 7 months ago
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
Matthew Andrews, Antonio Fernández, Mor Har...
159
Voted
BMCBI
2011
14 years 7 months ago
Clustering gene expression data with a penalized graph-based metric
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
Ariel E. Bayá, Pablo M. Granitto
135
Voted
WSNA
2003
ACM
15 years 8 months ago
Information-directed routing in ad hoc sensor networks
—In a sensor network, data routing is tightly coupled to the needs of a sensing task, and hence the application semantics. This paper introduces the novel idea of information-dir...
Juan Liu, Feng Zhao, Dragan Petrovic