Sciweavers

1368 search results - page 268 / 274
» Generalized Rook Polynomials
Sort
View
CORR
2007
Springer
167views Education» more  CORR 2007»
13 years 6 months ago
Approximation Algorithms for Orienteering with Time Windows
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
Chandra Chekuri, Nitish Korula
JACM
2006
93views more  JACM 2006»
13 years 6 months ago
Combining expert advice in reactive environments
"Experts algorithms" constitute a methodology for choosing actions repeatedly, when the rewards depend both on the choice of action and on the unknown current state of t...
Daniela Pucci de Farias, Nimrod Megiddo
DAM
2007
107views more  DAM 2007»
13 years 6 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
JCB
2006
107views more  JCB 2006»
13 years 6 months ago
Maximum Likelihood Molecular Clock Comb: Analytic Solutions
Maximum likelihood (ML) is increasingly used as an optimality criterion for selecting evolutionary trees, but finding the global optimum is a hard computational task. Because no g...
Benny Chor, Amit Khetan, Sagi Snir
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
13 years 6 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...