536 search results - page 73 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
110
click to vote
INTEGRATION
2007
15 years 1 months ago
2007
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 ...
111
click to vote
ATAL
2008
Springer
15 years 4 months ago
2008
Springer
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...
106
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
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...
120
click to vote
STOC
1998
ACM
15 years 6 months ago
1998
ACM
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) ...
143
click to vote
OPODIS
2010
14 years 12 months ago
2010
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...