Sciweavers

2430 search results - page 327 / 486
» Computing Tutte Polynomials
Sort
View
CP
2001
Springer
15 years 11 months ago
Random 3-SAT and BDDs: The Plot Thickens Further
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
Alfonso San Miguel Aguirre, Moshe Y. Vardi
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
15 years 11 months ago
SNPs Problems, Complexity, and Algorithms
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross...
ESA
2007
Springer
153views Algorithms» more  ESA 2007»
15 years 10 months ago
Tradeoffs and Average-Case Equilibria in Selfish Routing
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
Martin Hoefer, Alexander Souza
PODC
2010
ACM
15 years 10 months ago
Finding mobile data under delay constraints with searching costs
A token is hidden in one of several boxes and then the boxes are locked. The probability of placing the token in each of the boxes is known. A searcher is looking for the token by...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002,...
DSN
2004
IEEE
15 years 10 months ago
Automated Synthesis of Multitolerance
We concentrate on automated synthesis of multitolerant programs, i.e., programs that tolerate multiple classes of faults and provide a (possibly) different level of fault-toleranc...
Sandeep S. Kulkarni, Ali Ebnenasir