Sciweavers

7773 search results - page 1194 / 1555
» On generalized Frame-Stewart numbers
Sort
View
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
15 years 8 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson
AAAI
1990
15 years 8 months ago
Negotiation and Conflict Resolution in Non-Cooperative Domains
In previous work [Zlotkin and Rosenschein, 1989a], we have developed a negotiation protocol and offered some negotiation strategies that are in equilibrium. This negotiation proce...
Gilad Zlotkin, Jeffrey S. Rosenschein
AIPS
2009
15 years 8 months ago
Enhancing the Context-Enhanced Additive Heuristic with Precedence Constraints
Recently, Helmert and Geffner proposed the context-enhanced additive heuristic, where fact costs are evaluated relative to context states that arise from achieving first a pivot c...
Dunbo Cai, Jörg Hoffmann, Malte Helmert
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
15 years 8 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...
ATAL
2010
Springer
15 years 8 months ago
Quasi deterministic POMDPs and DecPOMDPs
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
Camille Besse, Brahim Chaib-draa
« Prev « First page 1194 / 1555 Last » Next »