Sciweavers

1263 search results - page 52 / 253
» A* with Bounded Costs
Sort
View
DAC
2012
ACM
13 years 5 days ago
STM concurrency control for embedded real-time software with tighter time bounds
We consider software transactional memory (STM) concurrency control for multicore real-time software, and present a novel contention manager (CM) for resolving transactional con...
Mohammed El-Shambakey, Binoy Ravindran
DAGSTUHL
2007
14 years 11 months ago
The Sinkhorn-Knopp Algorithm: Convergence and Applications
As long as a square nonnegative matrix A contains sufficient nonzero elements, then the Sinkhorn-Knopp algorithm can be used to balance the matrix, that is, to find a diagonal sc...
Philip A. Knight
SIAMAM
2000
91views more  SIAMAM 2000»
14 years 9 months ago
Competition in a Chemostat with Wall Attachment
Abstract. A mathematical model of microbial competition for limiting nutrient and wallattachment sites in a chemostat, formulated by Freter et al. in their study of the colonizatio...
Eric D. Stemmons, Hal L. Smith
AAAI
2007
15 years 2 days ago
Learning Equilibrium in Resource Selection Games
We consider a resource selection game with incomplete information about the resource-cost functions. All the players know is the set of players, an upper bound on the possible cos...
Itai Ashlagi, Dov Monderer, Moshe Tennenholtz
EUROCRYPT
2004
Springer
15 years 3 months ago
Optimal Communication Complexity of Generic Multicast Key Distribution
We prove a tight lower bound for generic protocols for secure multicast key distribution where the messages sent by the group manager for rekeying the group are obtained by arbitra...
Daniele Micciancio, Saurabh Panjwani