Sciweavers

536 search results - page 73 / 108
» Some Lower Bounds for the Complexity of Continuation Methods
Sort
View
INTEGRATION
2007
69views more  INTEGRATION 2007»
13 years 8 months ago
A fast algorithm for rectilinear block packing based on selected sequence-pair
In this paper, we present a method of rectilinear block packing using selected sequence-pair (SSP), a rectangle packing representation. We also propose a fast algorithm to obtain ...
Kunihiro Fujiyoshi, Chikaaki Kodama, Akira Ikeda
ATAL
2008
Springer
13 years 10 months ago
Controlling deliberation in a Markov decision process-based agent
Meta-level control manages the allocation of limited resources to deliberative actions. This paper discusses efforts in adding meta-level control capabilities to a Markov Decision...
George Alexander, Anita Raja, David J. Musliner
CORR
2010
Springer
70views Education» more  CORR 2010»
13 years 8 months ago
Simultaneous communication in noisy channels
A sender wishes to broadcast a message of length n over an alphabet of size k to r users, where each user i, 1 i r should be able to receive one of possible mi messages. The cha...
Amit Weinstein
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
14 years 22 days ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
OPODIS
2010
13 years 6 months ago
An Adaptive Technique for Constructing Robust and High-Throughput Shared Objects
Abstract. Shared counters are the key to solving a variety of coordination problems on multiprocessor machines, such as barrier synchronization and index distribution. It is desire...
Danny Hendler, Shay Kutten, Erez Michalak