Sciweavers

1341 search results - page 239 / 269
» Probabilistic Abstraction Hierarchies
Sort
View
78
Voted
ALGORITHMICA
2005
93views more  ALGORITHMICA 2005»
14 years 10 months ago
Universal Asymptotics for Random Tries and PATRICIA Trees
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
Luc Devroye
99
Voted
TON
2008
239views more  TON 2008»
14 years 10 months ago
Characterization of failures in an operational IP backbone network
Abstract--As the Internet evolves into a ubiquitous communication infrastructure and supports increasingly important services, its dependability in the presence of various failures...
Athina Markopoulou, Gianluca Iannaccone, Supratik ...
101
Voted
COMPUTER
2002
129views more  COMPUTER 2002»
14 years 10 months ago
Networks on Chips: A New SoC Paradigm
of abstraction and coarse granularity and distributed communication control. Focusing on using probabilistic metrics such as average values or variance to quantify design objective...
Luca Benini, Giovanni De Micheli
90
Voted
JAR
2002
83views more  JAR 2002»
14 years 10 months ago
Mathematical Programming Embeddings of Logic
Abstract. Can theorem proving in mathematical logic be addressed by classical mathematical techniques like the calculus of variations? The answer is surprisingly in the affirmative...
Vivek S. Borkar, Vijay Chandru, Sanjoy K. Mitter
97
Voted
JCO
1998
136views more  JCO 1998»
14 years 10 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...