2168 search results - page 131 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
152
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
A collaborative filtering system at an e-commerce site or similar service uses data about aggregate user behavior to make recommendations tailored to specific user interests. We d...
142
click to vote
IPSN
2009
Springer
15 years 10 months ago
2009
Springer
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...
129
click to vote
ATAL
2009
Springer
15 years 5 months ago
2009
Springer
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
140
click to vote
JMLR
2006
15 years 4 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
170
click to vote
CGA
1999
15 years 3 months ago
1999
emsintovirtualenvironments,whileabstracting the modeling process as much as possible. To achieve efficiency,weconcentrateoncullingdynamicalsystems: if the system is not in view, we...