Sciweavers

1336 search results - page 167 / 268
» SMTP Path Analysis
Sort
View
115
Voted
FLAIRS
2006
15 years 3 months ago
Efficient Bids on Task Allocation for Multi-Robot Exploration
We propose a real time single item auction based task allocation method for the multi-robot exploration problem and investigate new bid evaluation strategies in this domain. In th...
Sanem Sariel, Tucker R. Balch
138
Voted
CASCON
2000
119views Education» more  CASCON 2000»
15 years 3 months ago
Efficient mapping of software system traces to architectural views
Information about a software system's execution can help a developer with many tasks, including software testing, performance tuning, and program understanding. In almost all...
Robert J. Walker, Gail C. Murphy, Jeffrey Steinbok...
103
Voted
NETWORKING
2000
15 years 3 months ago
Performance of Short TCP Transfers
Many works have studied the negative impact of slow start on the performance of short transfers. Some works propose to accelerate the window increase during this phase in order to ...
Chadi Barakat, Eitan Altman
114
Voted
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 2 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli
114
Voted
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
15 years 2 months ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri