Sciweavers

696 search results - page 33 / 140
» A class of combinatorial identities
Sort
View
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
15 years 6 months ago
Towards an Analysis of Local Optimization Algorithms
We introduce a variant of Aldous and Vazirani's \Go with the winners" algorithm that can be used for search graphs that are not trees. We analyze the algorithm in terms ...
Tassos Dimitriou, Russell Impagliazzo
TCS
2008
15 years 1 months ago
Solving difference equations whose coefficients are not transcendental
We consider a large class of sequences, called admissible sequences, which are defined by systems of (possibly nonlinear) difference equations. A procedure for recursively enumera...
Manuel Kauers
SIAMCOMP
2000
101views more  SIAMCOMP 2000»
15 years 1 months ago
The Complexity of the A B C Problem
-fields are a very general class of difference fields that enable one to discover and prove multisum identities arising in combinatorics and special functions. In this article we f...
Jin-yi Cai, Richard J. Lipton, Yechezkel Zalcstein
SWAT
2004
Springer
129views Algorithms» more  SWAT 2004»
15 years 7 months ago
Online Scheduling of Splittable Tasks in Peer-to-Peer Networks
We consider online scheduling of splittable tasks on parallel machines. In our model, each task can be split into a limited number of parts, that can then be scheduled independentl...
Leah Epstein, Rob van Stee
ISMB
1998
15 years 3 months ago
Identification of Divergent Functions in Homologous Proteins by Induction over Conserved Modules
Homologousproteins do not necessarily exhibit identical biochemicalfunction. Despitethis fact, local or global sequence similarity is widely used as an indication of functional id...
Imran Shah, Lawrence Hunter