Sciweavers

1554 search results - page 305 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
PODC
2004
ACM
14 years 25 days ago
Mechanism design for policy routing
The Border Gateway Protocol (BGP) for interdomain routing is designed to allow autonomous systems (ASes) to express policy preferences over alternative routes. We model these pref...
Joan Feigenbaum, Rahul Sami, Scott Shenker
VMCAI
2004
Springer
14 years 23 days ago
Boolean Algebra of Shape Analysis Constraints
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
Viktor Kuncak, Martin C. Rinard
PLDI
2003
ACM
14 years 20 days ago
Meta optimization: improving compiler heuristics with machine learning
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...
Mark Stephenson, Saman P. Amarasinghe, Martin C. M...
SIGMETRICS
2003
ACM
165views Hardware» more  SIGMETRICS 2003»
14 years 20 days ago
A hybrid systems modeling framework for fast and accurate simulation of data communication networks
In this paper we present a general hybrid systems modeling framework to describe the flow of traffic in communication networks. To characterize network behavior, these models use...
Stephan Bohacek, João P. Hespanha, Junsoo L...
FOCS
2002
IEEE
14 years 11 days ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg