11561 search results - page 2018 / 2313 » Open Distributed Processing |
131
Voted
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
115
click to vote
ASPDAC
2008
ACM
15 years 6 months ago
2008
ACM
- In this paper, we present a new global router, NTHU-Route, for modern designs. NTHU-Route is based on iterative rip-ups and reroutes, and several techniques are proposed to enhan...
148
Voted
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Future agent applications will increasingly represent human users autonomously or semi-autonomously in strategic interactions with similar entities. Hence, there is a growing need...
136
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Service matchmaking is the process of finding suitable services given by the providers for the service requests of consumers. Previous approaches to service matchmaking is mostly ...
159
Voted
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...