Sciweavers

590 search results - page 91 / 118
» Resolution-stationary random number generators
Sort
View
SWAT
2004
Springer
163views Algorithms» more  SWAT 2004»
15 years 11 months ago
New Algorithms for Enumerating All Maximal Cliques
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
Kazuhisa Makino, Takeaki Uno
171
Voted
LATINCRYPT
2010
15 years 4 months ago
Generic Attacks on Misty Schemes
Abstract. Misty schemes are classic cryptographic schemes used to construct pseudo-random permutations from 2n bits to 2n bits by using d pseudo-random permutations from n bits to ...
Valérie Nachef, Jacques Patarin, Joana Treg...
158
Voted
SYNTHESE
2010
99views more  SYNTHESE 2010»
15 years 9 days ago
The epistemology of science - a bird's-eye view
In this paper I outline my conception of the epistemology of science, by reference to my published papers, showing how the ideas presented there fit together. In particular I disc...
Alexander Bird
SIGSOFT
1998
ACM
15 years 9 months ago
Further Empirical Studies of Test Effectiveness
This paper reports on an empirical evaluation of the fault-detecting ability of two white-box software testing techniques: decision coverage (branch testing) and the all-uses data...
Phyllis G. Frankl, Oleg Iakounenko
WSC
2008
15 years 8 months ago
SR-1: A simulation-based algorithm for the Capacitated Vehicle Routing Problem
In this paper we present SR-1, a simulation-based heuristic algorithm for the Capacitated Vehicle Routing Problem (CVRP). Given a CVRP instance, SR-1 uses an initial "good so...
Javier Faulin, Miquel Gilibert, Angel A. Juan, Xav...