Sciweavers

4670 search results - page 358 / 934
» Testing that distributions are close
Sort
View
TCBB
2008
82views more  TCBB 2008»
15 years 6 months ago
Efficient Algorithms to Explore Conformation Spaces of Flexible Protein Loops
Two efficient and complementary sampling algorithms are presented to explore the space of closed clash-free conformations of a flexible protein loop. The "seed sampling" ...
Peggy Yao, Ankur Dhanik, Nathan Marz, Ryan Propper...
195
Voted
IOR
2007
82views more  IOR 2007»
15 years 6 months ago
Compensating for Failures with Flexible Servers
We consider the problem of maximizing capacity in a queueing network with flexible servers, where the classes and servers are subject to failure. We assume that the interarrival ...
Sigrún Andradóttir, Hayriye Ayhan, D...
PC
2002
82views Management» more  PC 2002»
15 years 6 months ago
Time-minimal tiling when rise is larger than zero
This paper presents a solution to the open problem of finding the optimal tile size to minimise the execution time of a parallelogram-shaped iteration space on a distributed memory...
Jingling Xue, Wentong Cai
TCS
1998
15 years 6 months ago
ERCW PRAMs and Optical Communication
This paper presents algorithms and lower bounds for several fundamental problems on the Exclusive Read, Concurrent Write Parallel Random Access Machine (ERCW PRAM) and some result...
Philip D. MacKenzie, Vijaya Ramachandran
TROB
2002
88views more  TROB 2002»
15 years 6 months ago
Gripper point contacts for part alignment
-- The initial resting pose of many industrial parts differs from the orientation desired for assembly. We show that it is possible to align parts during grasping using a standard ...
Mike Tao Zhang, Ken Goldberg