Sciweavers

49 search results - page 9 / 10
» Timing Analysis with Implicitly Specified False Paths
Sort
View
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
14 years 5 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...
PLDI
2012
ACM
11 years 7 months ago
Automated error diagnosis using abductive inference
When program verification tools fail to verify a program, either the program is buggy or the report is a false alarm. In this situation, the burden is on the user to manually cla...
Isil Dillig, Thomas Dillig, Alex Aiken
CIKM
2008
Springer
13 years 7 months ago
The query-flow graph: model and applications
Query logs record the queries and the actions of the users of search engines, and as such they contain valuable information about the interests, the preferences, and the behavior ...
Paolo Boldi, Francesco Bonchi, Carlos Castillo, De...
APCCM
2006
13 years 6 months ago
Network data mining: methods and techniques for discovering deep linkage between attributes
Network Data Mining identifies emergent networks between myriads of individual data items and utilises special algorithms that aid visualisation of `emergent' patterns and tre...
John Galloway, Simeon J. Simoff
POPL
2004
ACM
14 years 5 months ago
Global value numbering using random interpretation
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
Sumit Gulwani, George C. Necula