Sciweavers

14518 search results - page 370 / 2904
» Two Problems for Sophistication
Sort
View
SIGCOMM
2006
ACM
16 years 1 months ago
Policy-based routing with non-strict preferences
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. S...
Chi-kin Chau
DATE
2005
IEEE
155views Hardware» more  DATE 2005»
16 years 1 months ago
Studying Storage-Recomputation Tradeoffs in Memory-Constrained Embedded Processing
Fueled by an unprecedented desire for convenience and self-service, consumers are embracing embedded technology solutions that enhance their mobile lifestyles. Consequently, we wi...
Mahmut T. Kandemir, Feihui Li, Guilin Chen, Guangy...
HPDC
2005
IEEE
16 years 1 months ago
Dynamic load balancing for distributed search
This paper examines how computation can be mapped across the nodes of a distributed search system to effectively utilize available resources. We specifically address computationa...
Larry Huston, Alex Nizhner, Padmanabhan Pillai, Ra...
ICRA
2005
IEEE
125views Robotics» more  ICRA 2005»
16 years 1 months ago
Temporal Logic Motion Planning for Mobile Robots
— In this paper, we consider the problem of robot motion planning in order to satisfy formulas expressible in temporal logics. Temporal logics naturally express traditional robot...
Georgios E. Fainekos, Hadas Kress-Gazit, George J....
ATAL
2005
Springer
16 years 1 months ago
Matchmaking multi-party interactions using historical performance data
Matchmaking will be an important component of future agent and agent-like systems, such as the semantic web. Most research on matchmaking has been directed toward sophisticated ma...
David Lambert, David Robertson