Sciweavers

392 search results - page 16 / 79
» Maximal Completion
Sort
View
JCO
2007
100views more  JCO 2007»
13 years 7 months ago
Semi-online scheduling with "end of sequence" information
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
Leah Epstein, Deshi Ye
COMSNETS
2012
176views more  COMSNETS 2012»
12 years 3 months ago
Capacity of Byzantine consensus in capacity limited point-to-point networks
—In this paper, we investigate the problem of maximizing the throughput, i.e., achieving capacity, of Byzantine consensus in point-to-point networks, in which each link has a cap...
Guanfeng Liang, Nitin H. Vaidya
WWW
2008
ACM
14 years 8 months ago
Optimal marketing strategies over social networks
We discuss the use of social networks in implementing viral marketing strategies. While influence maximization has been studied in this context (see Chapter 24 of [10]), we study ...
Jason D. Hartline, Vahab S. Mirrokni, Mukund Sunda...
IJCAI
2003
13 years 9 months ago
Query rewriting and answering under constraints in data integration systems
In this paper we address the problem of query answering and rewriting in global-as-view data integration systems, when key and inclusion dependencies are expressed on the global i...
Andrea Calì, Domenico Lembo, Riccardo Rosat...
JSAT
2007
63views more  JSAT 2007»
13 years 7 months ago
The Complexity of Some Subclasses of Minimal Unsatis able Formulas
This paper is concerned with the complexity of some natural subclasses of minimal unsatisfiable formulas. We show the DP –completeness of the classes of maximal and marginal mi...
Hans Kleine Büning, Xishun Zhao