Sciweavers

5316 search results - page 230 / 1064
» Which Search Problems Are Random
Sort
View
136
Voted
IROS
2009
IEEE
224views Robotics» more  IROS 2009»
15 years 11 months ago
Humanoid motion planning for dual-arm manipulation and re-grasping tasks
— In this paper, we present efficient solutions for planning motions of dual-arm manipulation and re-grasping tasks. Motion planning for such tasks on humanoid robots with a hig...
Niko Vahrenkamp, Dmitry Berenson, Tamim Asfour, Ja...
COMAD
2009
15 years 5 months ago
Graph Clustering for Keyword Search
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
Rose Catherine K., S. Sudarshan
AAAI
2008
15 years 6 months ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings
MIDDLEWARE
2004
Springer
15 years 10 months ago
A Content Model for Evaluating Peer-to-Peer Searching Techniques
Simulation studies are frequently used to evaluate new peer-to-peer searching techniques as well as existing techniques on new applications. Unless these studies are accurate in th...
Brian F. Cooper
BMCBI
2007
166views more  BMCBI 2007»
15 years 4 months ago
Optimization of filtering criterion for SEQUEST database searching to improve proteome coverage in shotgun proteomics
Background: In proteomic analysis, MS/MS spectra acquired by mass spectrometer are assigned to peptides by database searching algorithms such as SEQUEST. The assignations of pepti...
Xinning Jiang, Xiaogang Jiang, Guanghui Han, Mingl...