14518 search results - page 370 / 2904 » Two Problems for Sophistication |
174
Voted
SIGCOMM
2006
ACM
16 years 22 days ago
2006
ACM
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...
172
click to vote
DATE
2005
IEEE
16 years 12 days ago
2005
IEEE
Fueled by an unprecedented desire for convenience and self-service, consumers are embracing embedded technology solutions that enhance their mobile lifestyles. Consequently, we wi...
178
click to vote
HPDC
2005
IEEE
16 years 11 days ago
2005
IEEE
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...
187
click to vote
ICRA
2005
IEEE
16 years 11 days ago
2005
IEEE
— 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...
179
click to vote
ATAL
2005
Springer
16 years 9 days ago
2005
Springer
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...