Sciweavers

2492 search results - page 458 / 499
» On the General Signature Trees
Sort
View
CORR
2010
Springer
122views Education» more  CORR 2010»
13 years 9 months ago
Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...
Deeparnab Chakrabarty, Chaitanya Swamy
CORR
2007
Springer
133views Education» more  CORR 2007»
13 years 8 months ago
On Decidability Properties of Local Sentences
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
Olivier Finkel
BMCBI
2005
106views more  BMCBI 2005»
13 years 8 months ago
SIMPROT: Using an empirically determined indel distribution in simulations of protein evolution
Background: General protein evolution models help determine the baseline expectations for the evolution of sequences, and they have been extensively useful in sequence analysis an...
Andy Pang, Andrew D. Smith, Paulo A. S. Nuin, Elis...
AI
2002
Springer
13 years 8 months ago
Improving heuristic mini-max search by supervised learning
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
Michael Buro
AI
2002
Springer
13 years 8 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm