Sciweavers

358 search results - page 23 / 72
» GCD of Many Integers
Sort
View
CAV
2012
Springer
227views Hardware» more  CAV 2012»
11 years 10 months ago
Minimum Satisfying Assignments for SMT
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
Isil Dillig, Thomas Dillig, Kenneth L. McMillan, A...
ICSE
2009
IEEE-ACM
14 years 8 months ago
Listening to programmers - Taxonomies and characteristics of comments in operating system code
Innovations from multiple directions have been proposed to improve software reliability. Unfortunately, many of the innovations are not fully exploited by programmers. To bridge t...
Yoann Padioleau, Lin Tan, Yuanyuan Zhou
MFCS
2005
Springer
14 years 1 months ago
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
Piotr Krysta
WAOA
2004
Springer
141views Algorithms» more  WAOA 2004»
14 years 25 days ago
Strong Colorings of Hypergraphs
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
Geir Agnarsson, Magnús M. Halldórsso...
ARITH
1999
IEEE
13 years 11 months ago
Montgomery Modular Exponentiation on Reconfigurable Hardware
It is widely recognized that security issues will play a crucial role in the majority of future computer and communication systems. Central tools for achieving system security are...
Thomas Blum