Sciweavers

3495 search results - page 253 / 699
» On the random satisfiable process
Sort
View
ICRA
2008
IEEE
205views Robotics» more  ICRA 2008»
16 years 1 months ago
Minimum time point assignment for coverage by two constrained robots
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
WISE
2002
Springer
16 years 4 days ago
Evaluating and Enhancing Meta-Search Performance in Digital Libraries
Applying meta search systems is a suitable method to support the user if there are many different retrieval services available in the Web. Due to information splitting strategies ...
Bethina Schmitt, Sven Oberländer
ICALP
2003
Springer
16 years 13 days ago
Algorithmic Aspects of Bandwidth Trading
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...
Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph ...
IR
2006
15 years 7 months ago
A study of mixture models for collaborative filtering
Collaborative filtering is a general technique for exploiting the preference patterns of a group of users to predict the utility of items for a particular user. Three different co...
Rong Jin, Luo Si, Chengxiang Zhai
RECOMB
2005
Springer
16 years 7 months ago
Improved Duplication Models for Proteome Network Evolution
Protein-protein interaction networks, particularly that of the yeast S. Cerevisiae, have recently been studied extensively. These networks seem to satisfy the small world property ...
Gürkan Bebek, Petra Berenbrink, Colin Cooper,...