Results 1  10
of
632
Sold!: Auction Methods for Multirobot Coordination
, 2002
"... The key to utilizing the potential of multirobot systems is cooperation. How can we achieve cooperation in systems composed of failureprone autonomous robots operating in noisy, dynamic environments? In this paper, we present a novel method of dynamic task allocation for groups of such robots. We i ..."
Abstract

Cited by 318 (10 self)
 Add to MetaCart
implemented and tested an auctionbased task allocation system which we call MURDOCH, built upon a principled, resource centric, publish /subscribe communication model. A variant of the Contract Net Protocol, MURDOCH produces a distributed approximation to a global optimum of resource usage. We validated
RealTime 3D Model Acquisition
, 2002
"... The digitization of the 3D shape of real objects is a rapidly expanding field, with applications in entertainment, design, and archaeology. We propose a new 3D model acquisition system that permits the user to rotate an object by hand and see a continuouslyupdated model as the object is scanned. Th ..."
Abstract

Cited by 228 (7 self)
 Add to MetaCart
. This tight feedback loop allows the user to find and fill holes in the model in real time, and determine when the object has been completely covered. Our system is based on a 60 Hz. structuredlight rangefinder, a realtime variant of ICP (iterative closest points) for alignment, and pointbased merging
A generalization of tight closure and multiplier ideals
 TRANS. AM. MATH. SOC
, 2003
"... We introduce a new variant of tight closure associated to any fixed ideal a, which we call atight closure, and study various properties thereof. In our theory, the annihilator ideal τ(a) of all atight closure relations, which is a generalization of the test ideal in the usual tight closure theor ..."
Abstract

Cited by 82 (3 self)
 Add to MetaCart
We introduce a new variant of tight closure associated to any fixed ideal a, which we call atight closure, and study various properties thereof. In our theory, the annihilator ideal τ(a) of all atight closure relations, which is a generalization of the test ideal in the usual tight closure
An OAEP Variant With a Tight Security Proof
, 2002
"... We introduce the OAEP++ encoding method, which is an adaptation of the OAEP encoding method, replacing the last step of the encoding operation with an application of a block cipher such as AES. We demonstrate that if f is a oneway trapdoor function that is hard to invert, then OAEP++ combined with ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
with f is secure against an INDCCA2 adversary in the random oracle model. Moreover, the security reduction is tight; an adversary against fOAEP++ can be extended to an finverter with a running time linear in the number of oracle queries.
Tight Bounds on the Learnability of Evolution
, 1999
"... Evolution is often modeled as a stochastic process which modifies DNA. One of the most popular such processes are the CavenderFarris (CF) trees, which are represented as edge weighted trees. The Phylogeny Construction Problem is that of, given k samples drawn from a CF tree, output a CF tree which ..."
Abstract

Cited by 25 (1 self)
 Add to MetaCart
variant on one of the most popular algorithms used by practitioners, converges on the true tree at a rate which differs from the optimum by a constant. We do this by analyzing upper and lower bounds for the convergence rate of learning very simple CF trees, and then show that the learnability of each CF
Occludin 1B, a variant of the tight junction protein occludin
 Biol. Cell
"... Occludin and claudin are the major integral membrane components of the mammalian tight junction. Although more than 11 distinct claudins have been identified, only 1 occludin transcript has been reported thus far. Therefore, we searched by reverse transcription–PCR for occludinrelated sequences in M ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
Occludin and claudin are the major integral membrane components of the mammalian tight junction. Although more than 11 distinct claudins have been identified, only 1 occludin transcript has been reported thus far. Therefore, we searched by reverse transcription–PCR for occludinrelated sequences
TIGHT ANALYSES OF TWO LOCAL LOAD BALANCING ALGORITHMS
 SIAM J. COMPUT.
, 1999
"... This paper presents an analysis of the following load balancing algorithm. At each step, each node in a network examines the number of tokens at each of its neighbors and sends a token to each neighbor with at least 2d + 1 fewer tokens, where d is the maximum degree of any node in the network. We ..."
Abstract

Cited by 52 (5 self)
 Add to MetaCart
is the number of nodes in the network, and α is the edge expansion of the network. The time bound is tight in the sense that for any graph with edge expansion α, and for any value ∆, there exists an initial distribution of tokens with imbalance ∆ for which the time to reduce the imbalance to even ∆/2
How tight is the corner relaxation?
, 2005
"... Given a mixedinteger linear programming (MILP) model and an optimal basis of the associated linear programming relaxation, the Gomory’s corner relaxation is obtained by dropping nonnegativity constraints on the basic variables. Although this relaxation received a considerable attention in the liter ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
in the literature in the last 40 years, the crucial issue of evaluating the practical quality of the cornerrelaxation bound was not addressed so far. In the present paper we report, for the first time, the optimal value of the corner relaxation (in two possible variants) for a very large set of MILP instances from
Hierarchical Finite State Machines with Multiple Concurrency Models
 IEEE Transactions on Computeraided Design of Integrated Circuits and Systems
, 1999
"... This paper studies the semantics of hierarchical finite state machines (FMS's) that are composed using various concurrency models, particularly dataflow, discreteevents, and synchronous/reactive modeling. It is argued that all three combinations are useful, and that the concurrency model can b ..."
Abstract

Cited by 146 (43 self)
 Add to MetaCart
be selected independently of the decision to use hierarchical FSM's. In contrast, most formalisms that combine FSM's with concurrency models, such as Statecharts (and its variants) and hybrid systems, tightly integrate the FSM semantics with the concurrency semantics. An implementation that supports
Tight performance in Bayesian Scheduling
"... We consider a stochastic scheduling problem which generalizes traditional stochastic scheduling by introducing parameter uncertainty. Two classes of independent jobs have to be processed by a single machine so as to minimize the sum of expected completion times. The processing times of the jobs ar ..."
Abstract
 Add to MetaCart
the corresponding class, the scheduler can update his beliefs about this parameter yielding better future decision making. For the traditional stochastic scheduling variant, in which the parameters are known, the policy that always processes a job with shortest expected processing time (SEPT) is an optimal policy
Results 1  10
of
632