Sciweavers

1263 search results - page 107 / 253
» A* with Bounded Costs
Sort
View
IROS
2007
IEEE
127views Robotics» more  IROS 2007»
16 years 18 days ago
Goal directed navigation with uncertainty in adversary locations
— This paper addresses the problem of planning for goal directed navigation in the environment that contains a number of possible adversary locations. It first shows that common...
Maxim Likhachev, Anthony Stentz
ASIACRYPT
2007
Springer
16 years 15 days ago
Faster Addition and Doubling on Elliptic Curves
Edwards recently introduced a new normal form for elliptic curves. Every elliptic curve over a non-binary field is birationally equivalent to a curve in Edwards form over an exten...
Daniel J. Bernstein, Tanja Lange
BTW
2007
Springer
164views Database» more  BTW 2007»
16 years 15 days ago
Ruminations on Multi-Tenant Databases
: This is a position paper on multi-tenant databases. As motivation, it first describes the emerging marketplace of hosted enterprise services and the importance of using multi-ten...
Dean Jacobs, Stefan Aulbach
PODC
2009
ACM
16 years 6 months ago
Max registers, counters, and monotone circuits
A method is given for constructing a max register, a linearizable, wait-free concurrent data structure that supports a write operation and a read operation that returns the larges...
James Aspnes, Hagit Attiya, Keren Censor
WEA
2010
Springer
241views Algorithms» more  WEA 2010»
16 years 1 months ago
A Branch-and-Price Algorithm for Multi-mode Resource Leveling
Resource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized. We present ...
Eamonn T. Coughlan, Marco E. Lübbecke, Jens S...