Sciweavers

5105 search results - page 387 / 1021
» An algorithm to determine peer-reviewers
Sort
View
JCSS
2008
80views more  JCSS 2008»
15 years 6 months ago
Improved bounds on sorting by length-weighted reversals
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
Michael A. Bender, Dongdong Ge, Simai He, Haodong ...
JAR
2006
106views more  JAR 2006»
15 years 6 months ago
Some Computational Aspects of distance-sat
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
Olivier Bailleux, Pierre Marquis
JSAC
2006
147views more  JSAC 2006»
15 years 6 months ago
Smart pay access control via incentive alignment
We use game theorectic models to show the lack of incentives in the TCP congestion avoidance algorithm and the consequential systemwide network problems. We then propose a Vickery-...
Jun Shu, Pravin Varaiya
JSC
2006
95views more  JSC 2006»
15 years 6 months ago
Polyhedral conditions for the nonexistence of the MLE for hierarchical log-linear models
We provide a polyhedral description of the conditions for the existence of the maximum likelihood estimate (MLE) for a hierarchical log-linear model. The MLE exists if and only if...
Nicholas Eriksson, Stephen E. Fienberg, Alessandro...
ORL
2008
90views more  ORL 2008»
15 years 6 months ago
Optimal bundle pricing with monotonicity constraint
We consider the problem to sell items to a set of bidders. Bidders bid on bundles of items, and each item's availability is unbounded, like for digital goods. We need to dete...
Alexander Grigoriev, Joyce van Loon, Maxim Sviride...