46 search results - page 1 / 10 » The cost of getting local monotonicity |
ESA
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We study the problem of designing group-strategyproof costsharing mechanisms. The players report their bids for getting serviced and the mechanism decides a set of player...
ASPDAC
2009
ACM
13 years 9 months ago
2009
ACM
Global routing is an important step for physical design. In this paper, we develop a new global router, NTUgr, that contains three major steps: prerouting, initial routing, and enh...
IAT
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are di...
ECCC
2006
13 years 5 months ago
2006
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone error...
Presentation
In robotic navigation, path planning is aimed at getting the optimum collision-free
path between a starting and target locations. The optimality criterion depends on
the surround...