Sciweavers

248 search results - page 41 / 50
» The Relative Complexity of NP Search Problems
Sort
View
ICRA
2006
IEEE
99views Robotics» more  ICRA 2006»
14 years 1 months ago
MRSAM: a Quadratically Competitive Multi-robot Online Navigation Algorithm
— We explore an online problem where a group of robots has to find a target whose position is unknown in an unknown planar environment whose geometry is acquired by the robots d...
Shahar Sarid, Amir Shapiro, Yoav Gabriely
SPAA
2010
ACM
14 years 15 days ago
Towards optimizing energy costs of algorithms for shared memory architectures
Energy consumption by computer systems has emerged as an important concern. However, the energy consumed in executing an algorithm cannot be inferred from its performance alone: i...
Vijay Anand Korthikanti, Gul Agha
RECSYS
2009
ACM
14 years 2 months ago
Learning to recommend with trust and distrust relationships
With the exponential growth of Web contents, Recommender System has become indispensable for discovering new information that might interest Web users. Despite their success in th...
Hao Ma, Michael R. Lyu, Irwin King
CIKM
2009
Springer
14 years 2 months ago
Potential collaboration discovery using document clustering and community structure detection
Complex network analysis is a growing research area in a wide variety of domains and has recently become closely associated with data, text and web mining. One of the most active ...
Cristian Klen dos Santos, Alexandre Evsukoff, Beat...
JAIR
2007
146views more  JAIR 2007»
13 years 7 months ago
Semantic Matchmaking as Non-Monotonic Reasoning: A Description Logic Approach
Matchmaking arises when supply and demand meet in an electronic marketplace, or when agents search for a web service to perform some task, or even when recruiting agencies match c...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....