Sciweavers

344 search results - page 63 / 69
» Some Theorems We Should Prove
Sort
View
COCOON
2005
Springer
14 years 26 days ago
Share the Multicast Payment Fairly
Multicast routing uses a structure, either a tree or a mesh, to connect the receivers to the source, thus saving the bandwidth. How to share the cost among the receivers in a certa...
Weizhao Wang, Xiang-Yang Li, Zheng Sun
SODA
2012
ACM
253views Algorithms» more  SODA 2012»
11 years 9 months ago
Kernelization of packing problems
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
Holger Dell, Dániel Marx
GPCE
2004
Springer
14 years 21 days ago
Taming Macros
Scheme includes a simple yet powerful macro mechanism. Using macros, programmers can easily extend the language with new kinds of expressions and definitions, thus abstracting ove...
Ryan Culpepper, Matthias Felleisen
ARGMAS
2009
Springer
14 years 1 months ago
Burden of Proof in Deliberation Dialogs
The literature in argumentation and artificial intelligence has distinguished five types of burden of proof in persuasion dialogs, but there appears to have been no serious invest...
Douglas Walton
BMCBI
2010
117views more  BMCBI 2010»
13 years 7 months ago
Using jackknife to assess the quality of gene order phylogenies
Background: In recent years, gene order data has attracted increasing attention from both biologists and computer scientists as a new type of data for phylogenetic analysis. If ge...
Jian Shi, Yiwei Zhang, Haiwei Luo, Jijun Tang