Sciweavers

320 search results - page 14 / 64
» Conditionals and consequences
Sort
View
ICSE
2009
IEEE-ACM
13 years 7 months ago
Improving conflict resolution in model versioning systems
Collaborative software development is nowadays inconceivable without optimistic version control systems (VCSs). Without such systems the parallel modification of one artifact by m...
Petra Broschy
INFOCOM
2008
IEEE
14 years 4 months ago
Multihop Local Pooling for Distributed Throughput Maximization in Wireless Networks
Abstract—Efficient operation of wireless networks requires distributed routing and scheduling algorithms that take into account interference constraints. Recently, a few algorit...
Gil Zussman, Andrew Brzezinski, Eytan Modiano
FSE
2007
Springer
107views Cryptology» more  FSE 2007»
14 years 4 months ago
Message Freedom in MD4 and MD5 Collisions: Application to APOP
Abstract. In Wang’s attack, message modifications allow to deterministically satisfy certain sufficient conditions to find collisions efficiently. Unfortunately, message modi...
Gaëtan Leurent
COMBINATORICS
2002
73views more  COMBINATORICS 2002»
13 years 9 months ago
Prefix Exchanging and Pattern Avoidance by Involutions
Let In() denote the number of involutions in the symmetric group Sn which avoid the permutation . We say that two permutations , Sj may be exchanged if for every n, k, and order...
Aaron D. Jaggard
ENTCS
2007
119views more  ENTCS 2007»
13 years 10 months ago
Interpolant Learning and Reuse in SAT-Based Model Checking
Bounded Model Checking (BMC) is one of the most paradigmatic practical applications of Boolean Satisfiability (SAT). The utilization of SAT in model checking has allowed signifi...
João Marques-Silva