Sciweavers

3600 search results - page 461 / 720
» The settling-time reducibility ordering
Sort
View
HICSS
2003
IEEE
126views Biometrics» more  HICSS 2003»
16 years 1 days ago
E-Services in the Internet Job Market
In today’s rapidly changing workplace, it’s becoming more and more difficult for recruiters to find employees that are right for their business. Consideration of cultural fit,...
Georgios A. Dafoulas, Athanasios N. Nikolaou, Mike...
ICRA
2003
IEEE
158views Robotics» more  ICRA 2003»
16 years 1 days ago
Probabilistic cooperative localization and mapping in practice
In this paper we present a probabilistic framework for the reduction in the uncertainty of a moving robot pose during exploration by using a second robot to assist. A Monte Carlo ...
Ioannis M. Rekleitis, Gregory Dudek, Evangelos E. ...
IEEEPACT
2003
IEEE
16 years 1 days ago
Picking Statistically Valid and Early Simulation Points
Modern architecture research relies heavily on detailed pipeline simulation. Simulating the full execution of an industry standard benchmark can take weeks to months to complete. ...
Erez Perelman, Greg Hamerly, Brad Calder
IEEEPACT
2003
IEEE
16 years 1 days ago
Resolving Register Bank Conflicts for a Network Processor
This paper discusses a register bank assignment problem for a popular network processor--Intel's IXP. Due to limited data paths, the network processor has a restriction that ...
Xiaotong Zhuang, Santosh Pande
INFOCOM
2003
IEEE
16 years 1 days ago
YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology
— Existing peer-to-peer search networks generally fall into two categories: Gnutella-style systems that use arbitrary topology and rely on controlled flooding for search, and sy...
Prasanna Ganesan, Qixiang Sun, Hector Garcia-Molin...