Sciweavers

2766 search results - page 430 / 554
» Algorithms for trigonometric polynomials
Sort
View
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
15 years 5 months ago
Absolute convergence: true trees from short sequences
Fast-converging methods for reconstructing phylogenetic trees require that the sequences characterizing the taxa be of only polynomial length, a major asset in practice, since rea...
Tandy Warnow, Bernard M. E. Moret, Katherine St. J...
IJCAI
1997
15 years 5 months ago
Model Minimization, Regression, and Propositional STRIPS Planning
Propositional STRIPS planning problems can be viewed as finite state automata (FSAs) represented in a factored form. Automaton minimization is a well-known technique for reducing ...
Robert Givan, Thomas Dean
IJCAI
1993
15 years 5 months ago
Learning Finite Automata Using Local Distinguishing Experiments
One of the open problems listed in Rivest and Schapire, 1989] is whether and how that the copies of L in their algorithm can be combined into one for better performance. This pape...
Wei-Mein Shen
ATAL
2010
Springer
15 years 5 months ago
To teach or not to teach?: decision making under uncertainty in ad hoc teams
In typical multiagent teamwork settings, the teammates are either programmed together, or are otherwise provided with standard communication languages and coordination protocols. ...
Peter Stone, Sarit Kraus
ATAL
2010
Springer
15 years 5 months ago
Honor among thieves: collusion in multi-unit auctions
We consider collusion in multi-unit auctions where the allocation and payments are determined using the VCG mechanism. We show how collusion can increase the utility of the collud...
Yoram Bachrach